{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T15:13:29Z","timestamp":1784646809955,"version":"3.55.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["1513936"],"award-info":[{"award-number":["1513936"]}]},{"name":"NSF","award":["1350264"],"award-info":[{"award-number":["1350264"]}]},{"name":"NSF","award":["1903972"],"award-info":[{"award-number":["1903972"]}]},{"name":"NSF","award":["1935555"],"award-info":[{"award-number":["1935555"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.3031071","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:27:46Z","timestamp":1602790066000},"page":"6255-6271","source":"Crossref","is-referenced-by-count":74,"title":["Variance-Reduced Decentralized Stochastic Optimization With Accelerated Convergence"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8060-5581","authenticated-orcid":false,"given":"Soummya","family":"Kar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"954","article-title":"An accelerated decentralized stochastic proximal algorithm for finite sums","author":"hendrikx","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2933177"},{"key":"ref33","article-title":"A non-asymptotic analysis of network independence for distributed stochastic gradient descent","author":"olshevsky","year":"2019"},{"key":"ref32","article-title":"Distributed learning in non-convex environments—Part II: Polynomial escape from saddle-points","author":"vlaski","year":"2019"},{"key":"ref31","article-title":"An improved convergence analysis for decentralized online stochastic non-convex optimization","author":"xin","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3008605"},{"key":"ref37","first-page":"4624","article-title":"Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication","author":"shen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"key":"ref35","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":"ref34","first-page":"1","article-title":"Distributed stochastic gradient tracking methods","author":"pu","year":"2020","journal-title":"Math Program"},{"key":"ref28","first-page":"4848","article-title":"$D^2$: Decentralized training over decentralized data","author":"tang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","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 Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029217"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2937496"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref21","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2846183"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619047"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2436358"},{"key":"ref25","first-page":"2848","article-title":"A linearly convergent proximal gradient algorithm for decentralized optimization","author":"alghunaim","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref50","article-title":"Decentralized stochastic gradient tracking for empirical risk minimization","author":"zhang","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"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\/TSIPN.2019.2942191"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974267"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875898"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref19","article-title":"Convergence rate of distributed optimization algorithms based on gradient tracking","author":"sun","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235193"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref5","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":"ref8","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","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 Adv Neural Inf Process Syst"},{"key":"ref49","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","author":"assran","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","author":"nguyen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3166\/EJC.18.539-557"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/141000270"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref47","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":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461739"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2969721"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.04.010"},{"key":"ref43","first-page":"676","article-title":"A simple practical accelerated method for finite sums","author":"defazio","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/8933520\/9226112-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09226112.pdf?arnumber=9226112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:42Z","timestamp":1651070442000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9226112\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.3031071","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}