{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:56Z","timestamp":1740131696032,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007780","name":"Robert Bosch Center for Cyber-Physical Systems, Indian Institute of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Security and Privacy for Smart Cities sponsored by National Security Council, India"},{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation (NRF) Fellowship Programme","doi-asserted-by":"publisher","award":["A-0005077-01-00","A-0008064-00-00"],"award-info":[{"award-number":["A-0005077-01-00","A-0008064-00-00"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tit.2023.3315719","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T17:36:13Z","timestamp":1694799373000},"page":"2779-2806","source":"Crossref","is-referenced-by-count":0,"title":["Wyner-Ziv Estimators for Distributed Mean Estimation With Side Information and Optimization"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1433-7125","authenticated-orcid":false,"given":"Prathamesh","family":"Mayekar","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0736-4005","authenticated-orcid":false,"given":"Shubham","family":"Jha","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}]},{"given":"Ananda Theertha","family":"Suresh","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}]}],"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.","author":"Acharya"},{"key":"ref2","article-title":"Unified lower bounds for interactive high-dimensional estimation under information constraints","author":"Acharya","year":"2020","journal-title":"arXiv:2010.06562"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref7","article-title":"Optimal gradient compression for distributed and federated learning","author":"Albasyoni","year":"2020","journal-title":"arXiv:2010.03246"},{"key":"ref8","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh"},{"key":"ref9","article-title":"Mixed federated learning: Joint decentralized and centralized learning","author":"Augenstein","year":"2022","journal-title":"arXiv:2205.13655"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2020.2985917"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3218772"},{"key":"ref15","article-title":"New bounds for distributed mean estimation and variance reduction","author":"Davies","year":"2020","journal-title":"arXiv:2002.09268"},{"key":"ref16","article-title":"Optimality guarantees for distributed statistical estimation","author":"Duchi","year":"2014","journal-title":"arXiv:1405.0782"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"},{"key":"ref18","first-page":"3174","article-title":"Adaptive gradient quantization for data-parallel SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Faghri"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.21245"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3161620"},{"key":"ref21","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":"ref22","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1515\/9781400842902"},{"key":"ref24","first-page":"6371","article-title":"Optimal sparsity-sensitive bounds for distributed mean estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177582"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413697"},{"key":"ref27","first-page":"14280","article-title":"Leveraging spatial and temporal correlations in sparsified mean estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jhunjhunwala"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref29","first-page":"334","article-title":"Section of some finite-dimensional sets and classes of smooth functions (in Russian) izv","volume":"41","author":"Kashin","year":"1977","journal-title":"Acad. Nauk. SSSR"},{"key":"ref30","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":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040961"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517948"},{"key":"ref34","article-title":"Wyner-Ziv gradient compression for federated learning","author":"Liang","year":"2021","journal-title":"arXiv:2111.08277"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518254"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.12.110328"},{"article-title":"Polar codes and polar lattices for efficient communication and source quantization","year":"2016","author":"Liu","key":"ref37"},{"key":"ref38","article-title":"Polar lattices for lossy compression","author":"Liu","year":"2015","journal-title":"arXiv:1501.05683"},{"key":"ref39","article-title":"Moniqua: Modulo quantized communication in decentralized SGD","author":"Lu","year":"2020","journal-title":"arXiv:2002.11787"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048458"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834730"},{"key":"ref42","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":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174075"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058663"},{"volume-title":"Information-Based Complexity of Convex Programming","year":"1995","author":"Nemirovsky","key":"ref45"},{"volume-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"Nemirovsky","key":"ref46"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.641555"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref49","article-title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","author":"Ramezani-Kebrya","year":"2019","journal-title":"arXiv:1908.06077"},{"key":"ref50","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":"ref51","article-title":"Uncertainty principle for communication compression in distributed and federated learning and the search for an optimal compressor","author":"Safaryan","year":"2020","journal-title":"arXiv:2002.08958"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413527"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref54","first-page":"4452","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Stich"},{"key":"ref55","first-page":"20856","article-title":"Correlated quantization for distributed mean estimation and optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh"},{"key":"ref56","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Suresh"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref58","first-page":"14269","article-title":"PowerSGD: Practical low-rank gradient compression for distributed optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vogels"},{"key":"ref59","first-page":"9850","article-title":"ATOMO: Communication-efficient learning via atomic sparsification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref60","first-page":"1306","article-title":"Gradient sparsification for communication-efficient distributed optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wangni"},{"key":"ref61","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":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10475890\/10253643.pdf?arnumber=10253643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T19:57:29Z","timestamp":1711569449000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10253643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":63,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3315719","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}