{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:18:38Z","timestamp":1783700318695,"version":"3.55.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsp.2025.3564416","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:08:18Z","timestamp":1745514498000},"page":"1905-1921","source":"Crossref","is-referenced-by-count":7,"title":["Differential Error Feedback for Communication-Efficient Decentralized Learning"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9663-8559","authenticated-orcid":false,"given":"Roula","family":"Nassif","sequence":"first","affiliation":[{"name":"Université Côte d’Azur, CNRS, Sophia Antipolis, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0616-3076","authenticated-orcid":false,"given":"Stefan","family":"Vlaski","sequence":"additional","affiliation":[{"name":"Imperial College, SW7 2AZ London, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4973-2769","authenticated-orcid":false,"given":"Marco","family":"Carpentiero","sequence":"additional","affiliation":[{"name":"University of Salerno, Salerno, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-4027","authenticated-orcid":false,"given":"Vincenzo","family":"Matta","sequence":"additional","affiliation":[{"name":"University of Salerno, Salerno, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5125-5519","authenticated-orcid":false,"given":"Ali H.","family":"Sayed","sequence":"additional","affiliation":[{"name":"Institute of Electrical and Micro Engineering, EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SAM60225.2024.10636509"},{"key":"ref2","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","volume":"54","author":"McMahan","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref4","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2017"},{"key":"ref5","article-title":"Federated multi-task learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Smith","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000051"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2231991"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2966273"},{"key":"ref9","first-page":"4087","article-title":"A linearly convergent algorithm for decentralized optimization: Sending less bits for free!","volume-title":"Proc. Int. Conf. Artif. Intell","author":"Kovalev","year":"2021"},{"key":"ref10","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Koloskova","year":"2019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2987468"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3242710"},{"key":"ref13","first-page":"5381","article-title":"A unified theory of decentralized SGD with changing topology and local updates","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"119","author":"Koloskova","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2024.2322095"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927071"},{"issue":"276","key":"ref16","first-page":"1","article-title":"On biased compression for distributed learning","volume":"24","author":"Beznosikov","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738860"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2192928"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2223692"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/OJSP.2023.3344052"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2024.3464350"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref23","first-page":"9324","article-title":"Quantized decentralized stochastic learning over directed graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"119","author":"Taheri","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176253"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3287333"},{"key":"ref26","first-page":"31653","article-title":"BEER: Fast O(1\/T) rate for decentralized nonconvex optimization with communication compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Zhao","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2023.111363"},{"key":"ref28","first-page":"1","article-title":"Linear convergent decentralized optimization with compression","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Liu","year":"2021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3145576"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517986"},{"key":"ref31","first-page":"7663","article-title":"Communication compression for decentralized training","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Tang","year":"2018"},{"key":"ref32","first-page":"3252","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Karimireddy","year":"2019"},{"key":"ref33","article-title":"DeepSqueeze: Decentralization meets error-compensated compression","author":"Tang","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/9781009218146"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495287022"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2012.2219629"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/OJSP.2020.2989038"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2970336"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2676468"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981204"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2365686"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906495"},{"key":"ref45","first-page":"4452","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Stich","year":"2018"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2020.2985917"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3171173"},{"key":"ref49","first-page":"1253","article-title":"Towards model-free LQR control over rate-limited channels","volume-title":"Proc. Ann. Learn. Dyn. Control Conf.","volume":"242","author":"Mitra","year":"2024"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10807692\/10976577.pdf?arnumber=10976577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T17:37:12Z","timestamp":1749490632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976577\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tsp.2025.3564416","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}