{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:18:35Z","timestamp":1780766315578,"version":"3.54.1"},"reference-count":35,"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":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF","award":["1809327"],"award-info":[{"award-number":["1809327"]}]},{"name":"NSF","award":["CCF-1564000"],"award-info":[{"award-number":["CCF-1564000"]}]},{"name":"NSF","award":["HDR-1934932"],"award-info":[{"award-number":["HDR-1934932"]}]},{"name":"NSF","award":["IIS-1546452"],"award-info":[{"award-number":["IIS-1546452"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tpds.2021.3138977","type":"journal-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T21:04:51Z","timestamp":1640725491000},"page":"1-1","source":"Crossref","is-referenced-by-count":29,"title":["On the Benefits of Multiple Gossip Steps in Communication-Constrained Decentralized Federated Learning"],"prefix":"10.1109","author":[{"given":"Abolfazl","family":"Hashemi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anish","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudrajit","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haris","family":"Vikalo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sujay","family":"Sanghavi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICC47138.2019.9123209"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref35","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"xiao","year":"2017"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000083","article-title":"Advances and open problems in federated learning","volume":"14","author":"mcmahan","year":"2021","journal-title":"Foundations & Trends in Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref11","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2052384"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2015-354"},{"key":"ref16","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","first-page":"1","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref19","first-page":"643","article-title":"Gradient methods for minimizing functionals","volume":"3","author":"polyak","year":"1963","journal-title":"Zhurnal Vychislitel&#x2019;noi Matematiki i Matematicheskoi Fiziki"},{"key":"ref28","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":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref27","article-title":"Fast convergence of stochastic gradient descent under a strong growth condition","author":"schmidt","year":"2019"},{"key":"ref3","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3090331"},{"key":"ref29","first-page":"795","article-title":"Linear convergence of gradient and proximal-gradient methods under the Polyak-?ojasiewicz condition","author":"karimi","year":"2016","journal-title":"Proc Eur Conf Mach Learn Knowl Discov Databases-Volume 9851"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2975189"},{"key":"ref8","article-title":"Problems in decentralized decision making and computation","author":"tsitsiklis","year":"1984"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3040867"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref20","article-title":"Toward a theory of optimization for over-parameterized systems of non-linear equations: The lessons of deep learning","author":"liu","year":"2020"},{"key":"ref22","first-page":"3252","article-title":"Error feedback fixes signsgd and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","volume":"87","author":"nesterov","year":"0","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref24","first-page":"1","article-title":"Decentralized parallel algorithm for training generative adversarial nets","author":"liu","year":"2020","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref23","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"3325","article-title":"The power of interpolation: Understanding the effectiveness of SGD in modern over-parametrized learning","author":"ma","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","article-title":"Projected gradient method for decentralized optimization over time-varying networks","author":"rogozin","year":"2020"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/4359390\/09664349.pdf?arnumber=9664349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T15:58:01Z","timestamp":1653580681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9664349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/tpds.2021.3138977","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}