{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:14:07Z","timestamp":1740132847610,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3392351","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T20:13:52Z","timestamp":1713903232000},"page":"2333-2347","source":"Crossref","is-referenced-by-count":0,"title":["A Communication-Efficient Algorithm for Federated Multilevel Stochastic Compositional Optimization"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0915-196X","authenticated-orcid":false,"given":"Shuoguang","family":"Yang","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0904-4723","authenticated-orcid":false,"given":"Fengpei","family":"Li","sequence":"additional","affiliation":[{"name":"Morgan Stanley Machine Learning Research, Morgan Stanley, New York, NY, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1756","article-title":"Communication complexity of distributed convex learning and optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Arjevani","year":"2015"},{"key":"ref2","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Assran","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/21M1406222"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref5","first-page":"25294","article-title":"Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4099814"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1596\/1813-9450-6546"},{"issue":"1","key":"ref8","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"Dekel","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525015"},{"key":"ref10","first-page":"1126","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Finn","year":"2017"},{"key":"ref11","first-page":"25334","article-title":"Fast training method for stochastic compositional optimization problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Gao","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/18M1230542"},{"key":"ref13","first-page":"6929","article-title":"Efficient smooth non-convex stochastic compositional optimization via stochastic recursive gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Hu","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/19M1284865"},{"issue":"29","key":"ref15","first-page":"1","article-title":"Theoretical convergence of multi-step model-agnostic meta-learning","volume":"23","author":"Ji","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref16","doi-asserted-by":"crossref","first-page":"10195","DOI":"10.1007\/978-981-16-8193-6","article-title":"Optimal algorithms for stochastic multi-level compositional optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jiang","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1173-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/17M1157891"},{"article-title":"Federated learning: Collaborative machine learning without centralized training data","year":"2017","author":"Learning","key":"ref20"},{"key":"ref21","article-title":"Tilted empirical risk minimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2021"},{"key":"ref22","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lian","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683110"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691549"},{"key":"ref26","first-page":"3027","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Scaman","year":"2017"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611976595","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"Shapiro","year":"2021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"ref29","first-page":"21146","article-title":"FedNest: Federated bilevel, minimax, and compositional optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tarzanagh","year":"2022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"ref31","first-page":"1714","article-title":"Accelerating stochastic composition optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Wang","year":"2016"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/18M1164846"},{"key":"ref33","first-page":"238","article-title":"Decentralized gossip-based stochastic bilevel optimization over communication networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Yang","year":"2022"},{"article-title":"Stochastic recursive momentum method for non-convex compositional optimization","year":"2020","author":"Yuan","key":"ref34"},{"key":"ref35","first-page":"9078","article-title":"A stochastic composite gradient method with incremental variance reduction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Zhang","year":"2019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/19M1285457"},{"key":"ref37","first-page":"10571","article-title":"Robust multi-agent reinforcement learning with model uncertainty","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhang","year":"2020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60990-0_12"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/cdc.2012.6426691"},{"article-title":"Optimal algorithms for convex nested stochastic composite optimization","year":"2020","author":"Zhang","key":"ref40"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/10347386\/10507158.pdf?arnumber=10507158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T04:46:18Z","timestamp":1715834778000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10507158\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3392351","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2024]]}}}