{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:08:51Z","timestamp":1775228931637,"version":"3.50.1"},"reference-count":126,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CMMI-1903972"],"award-info":[{"award-number":["CMMI-1903972"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CBET-1935555"],"award-info":[{"award-number":["CBET-1935555"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Research Institute of Big Data","award":["J00120190011"],"award-info":[{"award-number":["J00120190011"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1717391"],"award-info":[{"award-number":["CCF-1717391"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/jproc.2020.3024266","type":"journal-article","created":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T20:09:25Z","timestamp":1603829365000},"page":"1869-1889","source":"Crossref","is-referenced-by-count":89,"title":["A General Framework for Decentralized Optimization With First-Order Methods"],"prefix":"10.1109","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5813-527X","authenticated-orcid":false,"given":"Shi","family":"Pu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9365-6321","authenticated-orcid":false,"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2672698"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2427352"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2427360"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref37","article-title":"The role of the network in distributed optimization algorithms: Convergence rates, scalability, communication\/computation tradeoffs and communication delays","author":"tsianos","year":"2013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875883"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875883"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/060678324"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2346657"},{"key":"ref20","article-title":"An improved convergence analysis for decentralized online stochastic non-convex optimization","author":"xin","year":"2020","journal-title":"arXiv 2008 04195"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791218"},{"key":"ref21","article-title":"A near-optimal stochastic gradient method for decentralized non-convex finite-sum optimization","author":"xin","year":"2020","journal-title":"arXiv 2008 07428"},{"key":"ref24","first-page":"9649","article-title":"Multi-agent reinforcement learning via double averaging primal-dual optimization","author":"wai","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2182347"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2920342"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2019.8899565"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/JPROC.2018.2817461","article-title":"Network topology and communication-computation tradeoffs in decentralized optimization","volume":"106","author":"nedi?","year":"2018","journal-title":"Proc IEEE"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039609"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2529285"},{"key":"ref59","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Proc NeurIPS"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3008605"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1666"},{"key":"ref52","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","author":"assran","year":"2019","journal-title":"Proceedings 36th Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"J Optim Theory Appl"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191450"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2615066"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.12.026"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.038"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-018-0596-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797164"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref126","author":"lecun","year":"1998","journal-title":"The MNIST Database of Handwritten Digits"},{"key":"ref125","first-page":"1000","article-title":"Communication-efficient distributed optimization using an approximate newton-type method","author":"shamir","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1137\/141000270"},{"key":"ref73","article-title":"Push-SAGA: A decentralized stochastic algorithm with variance reduction over directed graphs","author":"qureshi","year":"2020","journal-title":"arXiv 2008 06082"},{"key":"ref72","first-page":"1662","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","author":"li","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref71","article-title":"Improving the sample and communication complexity for decentralized non-convex optimization: A joint gradient estimation and tracking approach","author":"sun","year":"2019","journal-title":"arXiv 1910 05857"},{"key":"ref70","article-title":"Variance-reduced decentralized stochastic optimization with accelerated convergence","author":"xin","year":"2019","journal-title":"arXiv 1912 04230"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2617829"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619336"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2613678"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2666776"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264076"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref60","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","author":"nguyen","year":"2017","journal-title":"Proc ICML"},{"key":"ref62","first-page":"8194","article-title":"Katyusha: The first direct acceleration of stochastic gradient methods","volume":"18","author":"allen-zhu","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref61","first-page":"689","article-title":"Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","author":"fang","year":"2018","journal-title":"Proc NeurIPS"},{"key":"ref63","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","article-title":"Mini-batch semi-stochastic gradient descent in the proximal setting","volume":"10","author":"kone?n?","year":"2016","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"ref64","first-page":"2165","article-title":"DSA: Decentralized double stochastic averaging gradient algorithm","volume":"17","author":"mokhtari","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"key":"ref66","first-page":"4624","article-title":"Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication","author":"shen","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2933177"},{"key":"ref68","article-title":"Asynchronous accelerated proximal stochastic gradient for strongly convex distributed finite sums","author":"hendrikx","year":"2019","journal-title":"arXiv 1901 09865"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974267"},{"key":"ref1","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2942513"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2880407"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2972824"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-01357-w"},{"key":"ref93","first-page":"1","article-title":"Robust asynchronous stochastic gradient-push: Asymptotically optimal and network-independent performance for strongly convex functions","volume":"21","author":"spiridonoff","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref106","first-page":"7165","article-title":"Distributed optimization over weighted directed graphs using row stochastic matrix","author":"sy mai","year":"2016","journal-title":"Proc IEEE Amer Control Conf"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2730481"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235193"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2969721"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717479"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2291221"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927480"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029217"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2925537"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2474134"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009597"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029824"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2981035"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2930234"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383778"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619047"},{"key":"ref118","article-title":"A sharp estimate on the transient time of distributed stochastic gradient descent","author":"pu","year":"2019","journal-title":"arXiv 1906 02702"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2892055"},{"key":"ref117","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"2019","journal-title":"arXiv 1902 00340"},{"key":"ref17","article-title":"Second-order guarantees of distributed gradient algorithms","author":"daneshmand","year":"2018","journal-title":"arXiv 1809 08694"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref18","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2846183"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975212"},{"key":"ref19","first-page":"4848","article-title":"$D^{2}$\n: Decentralized training over decentralized data","volume":"80","author":"tang","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2943230"},{"key":"ref114","first-page":"6855","article-title":"Distributed optimization over time-varying directed graphs","author":"nedi?","year":"2013","journal-title":"Proc 52nd IEEE Conf Decis Control"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2937496"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619228"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618708"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref89","first-page":"3027","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3006420"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"key":"ref123","first-page":"676","article-title":"A simple practical accelerated method for finite sums","author":"defazio","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref85","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1750013"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3018743"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/5\/9241485\/9241497-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/9241485\/09241497.pdf?arnumber=9241497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:39:53Z","timestamp":1651066793000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9241497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":126,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2020.3024266","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}