{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:34:42Z","timestamp":1783701282216,"version":"3.55.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["ECCS-2207457"],"award-info":[{"award-number":["ECCS-2207457"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tcomm.2024.3471996","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T17:34:52Z","timestamp":1728063292000},"page":"2361-2374","source":"Crossref","is-referenced-by-count":6,"title":["Quantized and Asynchronous Federated Learning"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1446-2145","authenticated-orcid":false,"given":"Tomas","family":"Ortega","sequence":"first","affiliation":[{"name":"Center for Pervasive Communications &#x0026; Computing and the EECS Department, University of California at Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6838-8038","authenticated-orcid":false,"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications &#x0026; Computing and the EECS Department, University of California at Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Asynchronous federated learning with bidirectional quantized communications and buffered aggregation","volume-title":"Proc. Workshop Federated Learn. Anal. Pract. (ICML)","author":"Ortega"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3115357"},{"key":"ref4","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Koloskova"},{"key":"ref5","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"issue":"11","key":"ref7","doi-asserted-by":"crossref","first-page":"3548","DOI":"10.1109\/JSAC.2023.3310094","article-title":"TFL-DT: A trust evaluation scheme for federated learning in digital twin for mobile networks","volume":"41","author":"Guo","year":"2023","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"ref8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TWC.2020.3024629","article-title":"A joint learning and communications framework for federated learning over wireless networks","volume":"20","author":"Chen","year":"2021","journal-title":"IEEE Trans. Wireless Commun."},{"key":"ref9","article-title":"Machine learning model sizes and the parameter gap","author":"Villalobos","year":"2022","journal-title":"arXiv:2207.02852"},{"key":"ref10","article-title":"On the convergence of FedAvg on non-IID data","author":"Li","year":"2019","journal-title":"arXiv:1907.02189"},{"key":"ref11","article-title":"Federated optimization in heterogeneous networks","author":"Li","year":"2018","journal-title":"arXiv:1812.06127"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100595"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/bigdata50022.2020.9378161"},{"key":"ref14","first-page":"814","article-title":"PAPAYA: Practical, private, and scalable federated learning","volume-title":"Proc. Mach. Learn. Syst.","volume":"4","author":"Huba"},{"key":"ref15","first-page":"3581","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist.","author":"Nguyen"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929409"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3304788"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3354736"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACSOS55765.2022.00025"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3046971"},{"key":"ref21","article-title":"Optimal gradient compression for distributed and federated learning","author":"Albasyoni","year":"2020","journal-title":"arXiv:2010.03246"},{"key":"ref22","first-page":"3252","article-title":"Error feedback fixes sign SGD and other gradient compression schemes","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Karimireddy"},{"key":"ref23","article-title":"A better alternative to error feedback for communication-efficient distributed learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Horv\u00e1th"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3244092"},{"key":"ref25","first-page":"1707","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Alistarh"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/5.790632"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/0470847832"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/76.993440"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref31","first-page":"4452","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Stich"},{"key":"ref32","first-page":"5977","article-title":"The convergence of sparsified gradient methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Alistarh"},{"key":"ref33","first-page":"4384","article-title":"EF21: A new, simpler, theoretically better, and practically faster error feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Richtarik"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2023.3268988"},{"key":"ref35","first-page":"2387","article-title":"Preserved central model for faster bidirectional compression in distributed settings","volume-title":"Proc. 34th Annu. Conf. Neural Inf. Process. Syst.","author":"Philippenko"},{"key":"ref36","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"},{"key":"ref37","article-title":"Asynchronous federated optimization","volume-title":"Proc. 12th Annu. Workshop Optim. for Mach. Learn. (OPT2020)","author":"Xie"},{"key":"ref38","first-page":"2658","article-title":"The complexity of finding stationary points with stochastic gradient descent","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Drori"},{"key":"ref39","article-title":"LEAF: A benchmark for federated settings","volume-title":"Proc. NeurIPS","author":"Caldas"},{"key":"ref40","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref41","first-page":"192","article-title":"The loss surfaces of multilayer networks","volume-title":"Proc. 18th Int. Conf. Artif. Intell. Statist.","volume":"38","author":"Choromanska"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","volume":"137","author":"Nesterov","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3083316"},{"key":"ref44","first-page":"4519","article-title":"Tighter theory for local SGD on identical and heterogeneous data","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Khaled"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72792-5_30"},{"key":"ref46","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Paszke"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/iccv.2015.425"},{"key":"ref48","article-title":"Measuring the effects of non-identical data distribution for federated visual classification","author":"Harry Hsu","year":"2019","journal-title":"arXiv:1909.06335"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01261-8_1"},{"key":"ref50","first-page":"4387","article-title":"The non-IID data quagmire of decentralized machine learning","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Hsieh"},{"key":"ref51","first-page":"2951","article-title":"Practical Bayesian optimization of machine learning algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"25","author":"Snoek"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/10969449\/10705319-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/10969449\/10705319.pdf?arnumber=10705319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:46:51Z","timestamp":1744951611000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10705319\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":51,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3471996","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}