{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T05:09:53Z","timestamp":1777784993468,"version":"3.51.4"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1513936"],"award-info":[{"award-number":["CCF-1513936"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/lcsys.2021.3090652","type":"journal-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T20:17:13Z","timestamp":1624047433000},"page":"1202-1207","source":"Crossref","is-referenced-by-count":28,"title":["Push-SAGA: A Decentralized Stochastic Algorithm With Variance Reduction Over Directed Graphs"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0661-4156","authenticated-orcid":false,"given":"Muhammad I.","family":"Qureshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8060-5581","authenticated-orcid":false,"given":"Soummya","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref32","author":"qureshi","year":"2020","journal-title":"Push-SAGA A decentralized stochastic algorithm with variance reduction over directed graphs"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029217"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref11","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv NeurIPS"},{"key":"ref12","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 Adv NeurIPS"},{"key":"ref13","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","author":"nguyen","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"key":"ref16","first-page":"4624","article-title":"Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication","volume":"80","author":"shen","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref17","author":"hendrikx","year":"2019","journal-title":"Asynchronous accelerated proximal stochastic gradient for strongly convex distributed finite sums"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3031071"},{"key":"ref19","author":"xin","year":"2020","journal-title":"A near-optimal stochastic gradient method for decentralized non-convex finite-sum optimization"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029537"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"},{"key":"ref3","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 30th Adv NeurIPS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3062553"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref1","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":"ref20","author":"xin","year":"2020","journal-title":"A fast randomized incremental gradient method for decentralized non-convex optimization"},{"key":"ref22","first-page":"344","article-title":"Stochastic gradient-push for distributed deep learning","volume":"97","author":"assran","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2529285"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref23","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":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3006420"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/9462165\/9459958-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/9462165\/09459958.pdf?arnumber=9459958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:20:24Z","timestamp":1636410024000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9459958\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2021.3090652","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}