{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T15:13:28Z","timestamp":1784646808428,"version":"3.55.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1513936"],"award-info":[{"award-number":["1513936"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1903972"],"award-info":[{"award-number":["1903972"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1935555"],"award-info":[{"award-number":["1935555"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tac.2021.3122586","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T20:21:42Z","timestamp":1635279702000},"page":"5150-5165","source":"Crossref","is-referenced-by-count":34,"title":["A Fast Randomized Incremental Gradient Method for Decentralized Nonconvex Optimization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8060-5581","authenticated-orcid":false,"given":"Soummya","family":"Kar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","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":"ref38","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2017.00009"},{"key":"ref33","article-title":"Distributed stochastic gradient descent and convergence to local minima","author":"swenson","year":"2020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3050858"},{"key":"ref31","article-title":"A sharp estimate on the transient time of distributed stochastic gradient descent","author":"pu","year":"2019"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008713"},{"key":"ref37","first-page":"689","article-title":"SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","author":"fang","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref36","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","author":"nguyen","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref35","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref34","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2969721"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2914025"},{"key":"ref61","first-page":"4951","article-title":"Distributed zeroth order optimization over random networks: A Kiefer-Wolfowitz stochastic approximation approach","author":"sahu","year":"0","journal-title":"Proc IEEE Conf Decis Control"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3056535"},{"key":"ref27","article-title":"A unifying approximate method of multipliers for distributed composite optimization","author":"wu","year":"2020","journal-title":"arXiv 2009 12732"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906495"},{"key":"ref2","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3018743"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3062553"},{"key":"ref24","first-page":"31","article-title":"A unification and generalization of exact distributed first-order methods","volume":"5","author":"jakoveti?","year":"2019","journal-title":"IEEE Trans Signal Inf Process Netw Process"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2685559"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3086579"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3009363"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.3024321"},{"key":"ref51","article-title":"Linear convergence for distributed optimization under the Polyak-Lojasiewicz condition","author":"yi","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref57","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":"ref56","article-title":"A primal-dual SGD algorithm for distributed nonconvex optimization","author":"yi","year":"2020"},{"key":"ref55","first-page":"795","article-title":"Linear convergence of gradient and proximal-gradient methods under the Polyak-?ojasiewicz condition","author":"karimi","year":"0","journal-title":"Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases"},{"key":"ref54","volume":"1","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.57"},{"key":"ref52","first-page":"1145","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","author":"reddi","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974267"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3008605"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926022"},{"key":"ref14","first-page":"4848","article-title":"$D^{2}$: Decentralized training over decentralized data","author":"tang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2436358"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref3","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","author":"assran","year":"0","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3024266"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191450"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/16M1101702"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798553"},{"key":"ref45","article-title":"Fast decentralized non-convex finite-sum optimization with recursive variance reduction","author":"xin","year":"2021","journal-title":"SIAM J Optim"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00183-1"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/15M1049695"},{"key":"ref42","first-page":"1","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","volume":"21","author":"li","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"6255","DOI":"10.1109\/TSP.2020.3031071","article-title":"Variance-reduced decentralized stochastic optimization with accelerated convergence","volume":"68","author":"xin","year":"2020","journal-title":"IEEE Trans Signal Process"},{"key":"ref44","first-page":"9217","article-title":"Improving the sample and communication complexity for decentralized non-convex optimization: Joint gradient estimation and tracking","author":"sun","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","article-title":"Optimal accelerated variance reduced EXTRA and DIGing for strongly convex and smooth decentralized optimization","author":"li","year":"2020","journal-title":"arXiv 2009 04373"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9903918\/9585544-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9903918\/09585544.pdf?arnumber=9585544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:13:33Z","timestamp":1667524413000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9585544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":63,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tac.2021.3122586","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}