{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:48:35Z","timestamp":1784134115799,"version":"3.55.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601432"],"award-info":[{"award-number":["61601432"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62231022"],"award-info":[{"award-number":["62231022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2308085J24"],"award-info":[{"award-number":["2308085J24"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3363887","type":"journal-article","created":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T19:02:54Z","timestamp":1707418974000},"page":"1175-1188","source":"Crossref","is-referenced-by-count":52,"title":["Communication-Efficient Design for Quantized Decentralized Federated Learning"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1754-0607","authenticated-orcid":false,"given":"Li","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9447-5004","authenticated-orcid":false,"given":"Wei","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8083-1805","authenticated-orcid":false,"given":"Yunfei","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Durham, Durham, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3550-0625","authenticated-orcid":false,"given":"Weidong","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2584538"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2956472"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6824"},{"key":"ref5","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2975189"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154332"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2979149"},{"key":"ref9","first-page":"7611","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Wang","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref11","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Wen","year":"2017"},{"key":"ref12","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Stich","year":"2018"},{"key":"ref13","first-page":"21984","article-title":"EDEN: Communication-efficient and robust distributed mean estimation for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Vargaftik","year":"2022"},{"key":"ref14","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Alistarh","year":"2017"},{"key":"ref15","article-title":"IntSGD: Adaptive floatless compression of stochastic gradients","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mishchenko","year":"2021"},{"key":"ref16","first-page":"129","article-title":"Natural compression for distributed deep learning","volume-title":"Proc. Math. Scientific Mach. Learn.","author":"Horv\u00f3th","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413697"},{"key":"ref18","first-page":"3174","article-title":"Adaptive gradient quantization for data-parallel SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Faghri","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3201207"},{"key":"ref20","article-title":"Communication compression for decentralized training","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Tang","year":"2018"},{"key":"ref21","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":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3151242"},{"key":"ref23","article-title":"DeepSqueeze: Decentralization meets error-compensated compression","author":"Tang","year":"2019"},{"key":"ref24","article-title":"Fully decentralized federated learning","volume-title":"Proc. 3rd Workshop Bayesian Deep Learn. (NeurIPS)","volume":"2","author":"Lalitha","year":"2018"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref26","first-page":"4087","article-title":"A linearly convergent algorithm for decentralized optimization: Sending less bits for free!","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kovalev","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"ref28","first-page":"571","article-title":"Project Adam: Building an efficient and scalable deep learning training system","volume-title":"Proc. 11th USENIX Symp. Operating Syst. Des. Implementation (OSDI)","author":"Chilimbi","year":"2014"},{"key":"ref29","article-title":"Hogwild!: A lock-free approach to parallelizing stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Recht","year":"2011"},{"key":"ref30","article-title":"Asynchronous stochastic convex optimization: The noise is in the noise and SGD don\u2019t care","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Chaturapruek","year":"2015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057548"},{"key":"ref32","first-page":"7184","article-title":"On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu","year":"2019"},{"key":"ref33","article-title":"Communication-efficient design for quantized decentralized federated learning","author":"Chen","year":"2023"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015693"},{"key":"ref35","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lian","year":"2017"},{"issue":"213","key":"ref36","first-page":"1","article-title":"Cooperative SGD: A unified framework for the design and analysis of local-update SGD algorithms","volume":"22","author":"Wang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref37","article-title":"Local SGD converges fast and communicates little","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Stich","year":"2018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/10347386\/10429818.pdf?arnumber=10429818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T21:37:59Z","timestamp":1710365879000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10429818\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3363887","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}