{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:12:01Z","timestamp":1790183521600,"version":"4.1.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["#2007714"],"award-info":[{"award-number":["#2007714"]}]},{"name":"NSF","award":["#1955632"],"award-info":[{"award-number":["#1955632"]}]},{"name":"UC-NL","award":["LFR-18-548554"],"award-info":[{"award-number":["LFR-18-548554"]}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tac.2022.3145576","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T20:28:45Z","timestamp":1643142525000},"page":"721-736","source":"Crossref","is-referenced-by-count":52,"title":["SPARQ-SGD: Event-Triggered and Compressed Communication in Decentralized Optimization"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-2915","authenticated-orcid":false,"given":"Navjot","family":"Singh","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3544-8414","authenticated-orcid":false,"given":"Deepesh","family":"Data","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8417-5411","authenticated-orcid":false,"given":"Jemin","family":"George","sequence":"additional","affiliation":[{"name":"US Army Research Lab, Adelphi, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Lian","year":"2017"},{"key":"ref2","first-page":"7663","article-title":"Communication compression for decentralized training","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Tang","year":"2018"},{"key":"ref3","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Koloskova","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2015-354"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1045"},{"key":"ref6","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lin","year":"2018"},{"key":"ref7","first-page":"4447","article-title":"Sparsified SGD with memory","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Stich","year":"2018"},{"key":"ref8","first-page":"5973","article-title":"The convergence of sparsified gradient methods","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Alistarh","year":"2018"},{"key":"ref9","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Alistarh","year":"2017"},{"key":"ref10","first-page":"1508","article-title":"Terngrad: Ternary gradients to reduce communication in distributed deep learning","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Wen","year":"2017"},{"key":"ref11","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh","year":"2017"},{"key":"ref12","first-page":"3252","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref14","article-title":"Local SGD converges fast and communicates little","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Stich","year":"2019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015693"},{"key":"ref16","article-title":"Iterative parameter mixing for distributed large-margin training of structured predictors for natural language processing","author":"Coppola","year":"2015"},{"key":"ref17","article-title":"Decentralized deep learning with arbitrary communication compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Koloskova","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619539"},{"key":"ref19","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Assran","year":"2019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425820"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2174666"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.042"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2366855"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264668"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.03.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.11.015"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619311"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2694323"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3044843"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2867175"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3014316"},{"key":"ref33","first-page":"5050","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Chen","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738860"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3014095"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2600597"},{"key":"ref38","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303828"},{"key":"ref40","first-page":"1571","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rakhlin","year":"2012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869675"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/16M1057000"},{"key":"ref44","article-title":"MNIST handwritten digit database","volume":"2","author":"LeCun","year":"2010","journal-title":"ATT Labs"},{"key":"ref45","first-page":"2074","article-title":"Learning structured sparsity in deep neural networks","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Wen","year":"2016"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10031614\/9691792-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10031614\/09691792.pdf?arnumber=9691792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:33:47Z","timestamp":1705185227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9691792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3145576","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":[[2023,2]]}}}