{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:40:09Z","timestamp":1782834009248,"version":"3.54.5"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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 J. Select. Areas Commun."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/jsac.2023.3242735","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T18:45:39Z","timestamp":1675709139000},"page":"887-901","source":"Crossref","is-referenced-by-count":11,"title":["Laplacian Matrix Sampling for Communication- Efficient Decentralized Learning"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7361-2794","authenticated-orcid":false,"given":"Cho-Chun","family":"Chiu","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8751-7958","authenticated-orcid":false,"given":"Xusheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1070-7483","authenticated-orcid":false,"given":"Ting","family":"He","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2090-5512","authenticated-orcid":false,"given":"Shiqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[{"name":"DEVCOM Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"5336","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref35","year":"2022","journal-title":"The Internet Topology Zoo"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015482"},{"key":"ref15","first-page":"4848","article-title":"D2: Decentralized training over decentralized data","author":"tang","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref37","year":"2022","journal-title":"SpeedTest"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC47138.2019.9123209"},{"key":"ref36","article-title":"A first look into the carbon footprint of federated learning","author":"qiu","year":"2021","journal-title":"arXiv 2102 07627"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00089"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737464"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"ref10","first-page":"212","article-title":"Adaptive communication strategies to achieve the best error-runtime trade-off in local-update SGD","author":"wang","year":"2019","journal-title":"Proc Mach Learn Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc AISTATS"},{"key":"ref17","first-page":"7111","article-title":"Optimal complexity in decentralized training","author":"lu","year":"2021","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref39","year":"2022","journal-title":"Source Code for LMS"},{"key":"ref16","first-page":"3049","article-title":"Asynchronous decentralized parallel stochastic gradient descent","volume":"80","author":"lian","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref38","year":"2022","journal-title":"Source Code for MATCHA"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103920"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303828"},{"key":"ref24","article-title":"On matrix factorization and scheduling for finite-time average-consensus","author":"ko","year":"2010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.11.034"},{"key":"ref26","author":"bollob\u00e1s","year":"2013","journal-title":"Modern Graph Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737602"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF51394.2020.9443529"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref28","first-page":"5381","article-title":"A unified theory of decentralized SGD with changing topology and local updates","author":"koloskova","year":"2020","journal-title":"Proc ICML"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796818"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.1995.532300"},{"key":"ref8","first-page":"6415","article-title":"Moniqua: Modulo quantized communication in decentralized SGD","author":"lu","year":"2020","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref7","first-page":"1","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"2020","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref9","first-page":"1","article-title":"Communication compression for decentralized training","author":"tang","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref4","year":"2022","journal-title":"Google Assistant Using Federated Learning on Android to Improve ’Hey Google’ Accuracy"},{"key":"ref3","year":"2022","journal-title":"Google ai blog Federated learning Collaborative machine learning without centralized training data"},{"key":"ref6","year":"2022","journal-title":"Using Federated Learning to Improve Brave’s On-Device Recommendations While Protecting Your Privacy"},{"key":"ref5","year":"2022","journal-title":"Federated Learning of Cohorts (FLoC)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/10075675\/10038615.pdf?arnumber=10038615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T17:49:30Z","timestamp":1723052970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10038615\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2023.3242735","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}