{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:33:02Z","timestamp":1782833582907,"version":"3.54.5"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ericsson Canada"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council (NSERC) of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grants Council (RGC) Early Career Scheme","award":["22200324"],"award-info":[{"award-number":["22200324"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/ton.2025.3583308","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:37:40Z","timestamp":1751981860000},"page":"3162-3178","source":"Crossref","is-referenced-by-count":3,"title":["Age-of-Information Minimization With Weight Limits for Semi-Asynchronous Online Distributed Optimization"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1375-8382","authenticated-orcid":false,"given":"Juncheng","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1800-1322","authenticated-orcid":false,"given":"Ben","family":"Liang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7223-8865","authenticated-orcid":false,"given":"Min","family":"Dong","sequence":"additional","affiliation":[{"name":"Department of Electrical, Computer and Software Engineering, Ontario Tech University, Oshawa, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3539-9624","authenticated-orcid":false,"given":"Gary","family":"Boudreau","sequence":"additional","affiliation":[{"name":"Ericsson Canada, Ottawa, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5253-2429","authenticated-orcid":false,"given":"Ali","family":"Afana","sequence":"additional","affiliation":[{"name":"Ericsson Canada, Ottawa, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Intel. Conf. Artif. Intell. Statist. (AISTATS)","author":"Mcmahan"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/d17-1045"},{"key":"ref3","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Info. Proc. Sys. (NeurIPS)","author":"Alistarh"},{"key":"ref4","first-page":"5973","article-title":"The convergence of sparsified gradient methods","volume-title":"Proc. Adv. Neural Info. Proc. Sys. (NeurIPS)","author":"Alistarh"},{"key":"ref5","article-title":"Don\u2019t use large mini-batches, use local SGD","volume-title":"Proc. Intel. Conf. Learn. Represent. (ICLR)","author":"Lin"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref7","first-page":"3514","article-title":"Local SGD converges fast and communicates little","volume-title":"Proc. Intel. Conf. Learn. Represent. (ICLR)","author":"Stich"},{"key":"ref8","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst. (MLSys)","author":"Li"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2953131"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378161"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC51858.2021.9593194"},{"key":"ref12","first-page":"1","article-title":"Asynchronous federated optimization","volume-title":"Proc. NeurIPS Workshop Optim. Mach. Learn. (OPT)","author":"Xie"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2994391"},{"key":"ref14","first-page":"3581","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Nguyen"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118435"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3146871"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3394498"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.01.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2200\/s00954ed2v01y201909cnt023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053740"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.2000252"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS51825.2021.9484497"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2918736"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048692"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9163054"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2980911"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3025630"},{"key":"ref31","first-page":"2933","article-title":"Distributed online optimization over a heterogeneous network with any-batch mirror descent","volume-title":"Proc. Intel. Conf. Mach. Learn. (ICML)","author":"Eshraghi"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760092"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029474"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488709"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139626514"},{"key":"ref38","volume-title":"The MNIST Database","author":"LeCun","year":"1998"},{"key":"ref39","volume-title":"Fashion-mnist: A Novel Image Dataset for Benchmarking Machine Learning Algorithms","author":"Xiao","year":"2017"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11311125\/11072844.pdf?arnumber=11072844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:27:24Z","timestamp":1766471244000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11072844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":39,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3583308","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}