{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:46:02Z","timestamp":1782405962793,"version":"3.54.5"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"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":["1809327"],"award-info":[{"award-number":["1809327"]}],"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,12]]},"DOI":"10.1109\/tac.2021.3133372","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T20:30:09Z","timestamp":1638909009000},"page":"6583-6594","source":"Crossref","is-referenced-by-count":13,"title":["Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization Over Time-Varying Directed Graphs"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3945-526X","authenticated-orcid":false,"given":"Yiyue","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8421-4270","authenticated-orcid":false,"given":"Abolfazl","family":"Hashemi","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7945-4114","authenticated-orcid":false,"given":"Haris","family":"Vikalo","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref38","first-page":"9324","article-title":"Quantized decentralized stochastic learning over directed graphs","author":"taheri","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref33","article-title":"Improved convergence rates for non-convex federated learning with compression","author":"das","year":"2020"},{"key":"ref32","first-page":"4035","article-title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","volume":"70","author":"zhang","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref31","first-page":"1509","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","author":"wen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"7652","article-title":"Communication compression for decentralized training","author":"tang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","article-title":"On the benefits of multiple gossip steps in communication-constrained decentralized optimization","author":"hashemi","year":"2020"},{"key":"ref36","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref35","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":"ref34","first-page":"8386","article-title":"Robust and communication-efficient collaborative learning","author":"reisizadeh","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","author":"tsitsiklis","year":"1984","journal-title":"Problems in decentralized decision making and computation"},{"key":"ref40","article-title":"Communication-efficient variance-reduced decentralized stochastic optimization over time-varying directed graphs","author":"chen","year":"2021"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/MCS.2007.338264","article-title":"Information consensus in multivehicle cooperative control","volume":"27","author":"ren","year":"2007","journal-title":"IEEE Control Syst Mag"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2305952"},{"key":"ref14","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/08073038X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref18","first-page":"4497","article-title":"Decentralized online optimization with global objectives and local communication","author":"nedi?","year":"0","journal-title":"Proc Amer Control Conf"},{"key":"ref19","first-page":"4536","article-title":"Cola: Decentralized linear learning","author":"he","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5530578"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref27","first-page":"1662","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","author":"li","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3090652"},{"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","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415052"},{"key":"ref20","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","article-title":"Distributed optimization over time-varying directed graphs","volume":"60","author":"nedi?","year":"2015","journal-title":"IEEE Trans Autom Control"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref42","article-title":"The Stack Overflow Data","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2529285"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.038"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3031071"},{"key":"ref25","article-title":"Optimization over time-varying directed graphs with row and column-stochastic matrices","author":"saadatniaki","year":"2018"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9969927\/9640474-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9969927\/09640474.pdf?arnumber=9640474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:32:08Z","timestamp":1672083128000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9640474\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":42,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tac.2021.3133372","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,12]]}}}