{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:15:22Z","timestamp":1774966522015,"version":"3.50.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","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":"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":[{"name":"Ericsson and Mitacs of Canada"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tnet.2024.3511333","type":"journal-article","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T03:58:06Z","timestamp":1733889486000},"page":"761-776","source":"Crossref","is-referenced-by-count":2,"title":["Communication-Efficient Network Topology in Decentralized Learning: A Joint Design of Consensus Matrix and Resource Allocation"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3392-7016","authenticated-orcid":false,"given":"Jingrong","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}]},{"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0850-2710","authenticated-orcid":false,"given":"Zhongwen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Ericsson Global AI Accelerator, Montréal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3098-4082","authenticated-orcid":false,"given":"Emmanuel","family":"Thepie Fapi","sequence":"additional","affiliation":[{"name":"Ericsson Global AI Accelerator, Montréal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2574-4126","authenticated-orcid":false,"given":"Hardik","family":"Dalal","sequence":"additional","affiliation":[{"name":"Ericsson Global AI Accelerator, Montréal, QC, Canada"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking55013.2022.9829798"},{"key":"ref2","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","volume-title":"Proc. NeurIPS","volume":"27","author":"Li"},{"key":"ref3","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. AISTATS","author":"McMahan"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47436-2_67"},{"key":"ref7","article-title":"Data-heterogeneity-aware mixing for decentralized learning","author":"Dandi","year":"2022","journal-title":"arXiv:2204.06477"},{"key":"ref8","first-page":"1672","article-title":"Refined convergence and topology learning for decentralized optimization with heterogeneous data","volume-title":"Proc. AISTATS","author":"Le Bars"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"ref10","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. NeurIPS","volume":"30","author":"Lian"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054065"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2570808"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737602"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/21M1465081"},{"key":"ref15","first-page":"1073","article-title":"Communication-efficient topologies for decentralized learning with O(1) consensus rate","volume-title":"Proc. NeurIPS","author":"Song"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6161026"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2009.08.005"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039730"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2503561"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2813426"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00153"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488817"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3212536"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717719"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00040"},{"key":"ref26","first-page":"19478","article-title":"Throughput-optimal topology design for cross-silo federated learning","volume-title":"Proc. NeurIPS","author":"Marfoq"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2572004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2972824"},{"key":"ref30","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. ICML","volume":"97","author":"Koloskova"},{"key":"ref31","first-page":"1","article-title":"Decentralized deep learning with arbitrary communication compression","volume-title":"Proc. ICLR","author":"Koloskova"},{"key":"ref32","first-page":"31653","article-title":"BEER: Fast O(1\/T) rate for decentralized nonconvex optimization with communication compression","volume-title":"Proc. NeurIPS","author":"Zhao"},{"key":"ref33","first-page":"1","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","volume-title":"Proc. ICLR","author":"Lin"},{"key":"ref34","first-page":"1707","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. NeurIPS","author":"Alistarh"},{"key":"ref35","first-page":"1299","article-title":"Gradient sparsification for communication-efficient distributed optimization","volume-title":"Proc. NeurIPS","volume":"31","author":"Wangni"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737367"},{"key":"ref39","first-page":"2933","article-title":"Distributed online optimization over a heterogeneous network with any-batch mirror descent","volume-title":"Proc. ICML","author":"Eshraghi"},{"key":"ref40","first-page":"1","article-title":"Local SGD converges fast and communicates little","volume-title":"Proc. ICLR","author":"Stich"},{"key":"ref41","first-page":"13579","article-title":"Communication trade-offs for local-SGD with large step size","volume-title":"Proc. NeurIPS","volume":"32","author":"Dieuleveut"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.004.2200381"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.001.2100253"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.2000430"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3095077"},{"key":"ref46","volume-title":"Study on 5G System Support for AI\/ML-Based Services","year":"2022"},{"key":"ref47","first-page":"2348","article-title":"Decentralized gradient methods: Does topology matter?","volume-title":"Proc. AISTATS","author":"Neglia"},{"issue":"213","key":"ref48","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":"ref49","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref50","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1025-2","volume-title":"The Mathematics of Nonlinear Programming","author":"Peressini","year":"1988"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34097-0_7"},{"key":"ref52","first-page":"6434","article-title":"l4: Practical loss-based stepsize adaptation for deep learning","volume-title":"Proc. NeurIPS","author":"Rol\u00ednek"},{"key":"ref53","first-page":"3436","article-title":"Step size matters in deep learning","volume-title":"Proc. NeurIPS","volume":"31","author":"Nar"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10187"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2021.3063191"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582887"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2611964"},{"key":"ref58","volume-title":"MNIST Handwritten Digit Database","year":"2024"},{"key":"ref59","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/070689413"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/10969151\/10787450.pdf?arnumber=10787450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:45:09Z","timestamp":1744951509000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10787450\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":63,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3511333","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}