{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:56Z","timestamp":1740131756723,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100016918","name":"Robert Bosch Centre for Cyber-Physical Systems, Indian Institute of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016918","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Prime Minister\u2019s Research Fellowship (PMRF), Ministry of Education (MoE), India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tcomm.2024.3395291","type":"journal-article","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T19:01:22Z","timestamp":1714503682000},"page":"6360-6370","source":"Crossref","is-referenced-by-count":0,"title":["Fundamental Limits of Distributed Optimization Over Multiple Access Channel"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0736-4005","authenticated-orcid":false,"given":"Shubham","family":"Jha","sequence":"first","affiliation":[{"name":"Robert Bosch Center for Cyber-Physical Systems, Indian Institute of Science, Bengaluru, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"7126","article-title":"Information-constrained optimization: Can adaptive processing of gradients help?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Acharya"},{"key":"ref2","first-page":"51133","article-title":"Unified lower bounds for interactive high-dimensional estimation under information constraints","volume-title":"Proc. 37th Conf. Neural Inf. Process. Syst.","volume":"36","author":"Acharya"},{"key":"ref3","article-title":"Information-constrained optimization: Can adaptive processing of gradients help?","author":"Acharya","year":"2021","journal-title":"arXiv:2104.00979"},{"key":"ref4","first-page":"40","article-title":"Distributed learning with sublinear communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Acharya"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref6","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. NIPS","author":"Alistarh"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849334"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815402"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2020.2985917"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref11","article-title":"Communication efficient federated learning over multiple access channels","author":"Chang","year":"2020","journal-title":"arXiv:2001.08737"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3218772"},{"key":"ref13","first-page":"1","article-title":"New bounds for distributed mean estimation and variance reduction","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Davies"},{"key":"ref14","first-page":"2197","article-title":"VQSGD: Vector quantized stochastic gradient descent","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","volume":"130","author":"Gandikota"},{"key":"ref15","first-page":"18028","article-title":"Distributed Newton can communicate less and resist Byzantine workers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ghosh"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1515\/9781400842902"},{"key":"ref17","first-page":"6371","article-title":"Optimal sparsity-sensitive bounds for distributed mean estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"volume-title":"Over-The-Air Optimization","year":"2023","author":"Jha","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161622"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177582"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413697"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2018.00062"},{"article-title":"Federated learning: Strategies for improving communication efficiency","volume-title":"Proc. NIPS Workshop Private Multi-Party Mach. Learn.","author":"Konecn\u00fd","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518254"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3315719"},{"key":"ref26","first-page":"3502","article-title":"Wyner-Ziv estimators: Efficient distributed mean estimation with side-information","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mayekar"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174075"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058663"},{"key":"ref29","first-page":"2021","article-title":"FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Reisizadeh"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413527"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2989580"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322580"},{"key":"ref34","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh"},{"key":"ref35","first-page":"9850","article-title":"ATOMO: Communication-efficient learning via atomic sparsification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref36","first-page":"1509","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wen"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2961673"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488818"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3039309"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2023.3264649"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10721242\/10510390.pdf?arnumber=10510390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T04:35:48Z","timestamp":1729226148000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10510390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":40,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3395291","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}