{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:07:09Z","timestamp":1772039229180,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"AFOSR MURI","award":["FA9550-18-10502"],"award-info":[{"award-number":["FA9550-18-10502"]}]},{"name":"ONR","award":["N0001417121"],"award-info":[{"award-number":["N0001417121"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3056915","type":"journal-article","created":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T21:30:24Z","timestamp":1612560624000},"page":"1362-1377","source":"Crossref","is-referenced-by-count":6,"title":["Decentralized Learning With Lazy and Approximate Dual Gradients"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6584-1378","authenticated-orcid":false,"given":"Yanli","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yuejiao","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-9731","authenticated-orcid":false,"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Accelerated decentralized optimization with local updates for smooth and strongly convex objectives","author":"hendrikx","year":"0","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref32","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":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/2200000051"},{"key":"ref30","article-title":"Cooperative SGD: A unified framework for the design and analysis of communication-efficient SGD algorithms","author":"wang","year":"0","journal-title":"Proc ICML Workshop Coding Theory Mach Learn"},{"key":"ref35","article-title":"A Lyapunov analysis of momentum methods in optimization","author":"wilson","year":"2016"},{"key":"ref34","author":"young","year":"2014","journal-title":"Iterative Solution of Large Linear Systems"},{"key":"ref10","first-page":"4536","article-title":"Cola: Decentralized linear learning","author":"he","year":"0","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244951"},{"key":"ref12","article-title":"An accelerated decentralized stochastic proximal algorithm for finite sums","author":"hendrikx","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3018317"},{"key":"ref14","article-title":"Optimal and practical algorithms for smooth and strongly convex decentralized optimization","volume":"33","author":"kovalev","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2943230"},{"key":"ref16","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":"ref17","first-page":"2165","article-title":"Dsa: Decentralized double stochastic averaging gradient algorithm","volume":"17","author":"mokhtari","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref18","first-page":"4631","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":"ref19","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":"ref28","article-title":"Local SGD converges fast and communicates little","author":"stich","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref4","first-page":"8194","article-title":"Katyusha: The first direct acceleration of stochastic gradient methods","volume":"18","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref27","article-title":"Don’t use large mini-batches, use local SGD","author":"lin","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref3","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015693"},{"key":"ref5","first-page":"5050","article-title":"Lag: Lazily aggregated gradient for communication-efficient distributed learning","author":"chen","year":"0","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875898"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref1","first-page":"3027","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref20","first-page":"1058","article-title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns","author":"seide","year":"0","journal-title":"Proc 15th Annu Conf Int Speech Commun Assoc"},{"key":"ref22","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"0","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref21","first-page":"1488","article-title":"Scalable distributed dnn training using commodity gpu cloud computing","author":"strom","year":"0","journal-title":"Proc 16th Annu Conf Int Speech Commun Assoc"},{"key":"ref24","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"0","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref23","first-page":"559","article-title":"Signsgd: Compressed optimisation for non-convex problems","author":"bernstein","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","first-page":"1299","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"wangni","year":"0","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref25","first-page":"5973","article-title":"The convergence of sparsified gradient methods","author":"alistarh","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09347822.pdf?arnumber=9347822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:40Z","timestamp":1652194240000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9347822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3056915","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}