{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:34Z","timestamp":1740131674955,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Wipro Ltd."},{"DOI":"10.13039\/100011993","name":"Robert Bosch Center for Cyberphysical Systems (RBCCPS), Indian Institute of Science, Bengaluru","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011993","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Science and Technology (DST), India","award":["EMR\/2016\/002569"],"award-info":[{"award-number":["EMR\/2016\/002569"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tit.2021.3058663","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T22:21:37Z","timestamp":1613082097000},"page":"3130-3154","source":"Crossref","is-referenced-by-count":3,"title":["RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization"],"prefix":"10.1109","volume":"67","author":[{"given":"Prathamesh","family":"Mayekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Information-Based Complexity of Convex Programming","year":"1995","author":"nemirovsky","key":"ref39"},{"key":"ref38","first-page":"1399","article-title":"RATQ: A universal fixed-length quantizer for stochastic optimization","author":"mayekar","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057288"},{"key":"ref32","first-page":"819","article-title":"(Bandit) convex optimization with biased noisy gradient oracles","author":"hu","year":"2016","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"journal-title":"Hadamard Matrices and their Applications","year":"2012","author":"horadam","key":"ref31"},{"key":"ref30","first-page":"3163","article-title":"Geometric lower bounds for distributed parameter estimation under communication constraints","volume":"75","author":"han","year":"2018","journal-title":"Proc Int Conf Comput Learn Theory (COLT)"},{"key":"ref37","first-page":"153","article-title":"Low density codes achieve the rate-distortion bound","author":"martinian","year":"2006","journal-title":"Proc IEEE Data Compress Conf"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048458"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.567644"},{"key":"ref34","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"arXiv 1901 09847"},{"article-title":"Design and analysis of spherical codes","year":"1996","author":"hamkins","key":"ref28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.641545"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804056"},{"key":"ref2","article-title":"Inference under information constraints II: Communication constraints and shared randomness","author":"acharya","year":"2019","journal-title":"arXiv 1905 08302"},{"key":"ref1","article-title":"Inference under information constraints I: Lower bounds from chi-square contraction","author":"acharya","year":"2018","journal-title":"arXiv 1812 11476"},{"key":"ref20","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref22","first-page":"2726","article-title":"On communication cost of distributed statistical estimation and dimensionality","author":"garg","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","article-title":"VqSGD: Vector quantized stochastic gradient descent","author":"gandikota","year":"2019","journal-title":"arXiv 1911 07971"},{"key":"ref24","first-page":"1737","article-title":"Deep learning with limited numerical precision","author":"gupta","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref23","volume":"159","author":"gersho","year":"2012","journal-title":"Vector Quantization and Signal Compression"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.641545"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2599482"},{"key":"ref50","first-page":"9850","article-title":"ATOMO: Communication-efficient learning via atomic sparsification","author":"wang","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","first-page":"1509","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","author":"wen","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057034"},{"key":"ref56","first-page":"2328","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","author":"zhang","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref55","first-page":"1292","article-title":"Polar lattices: Where Ar?kan meets Forney","author":"yan","year":"2013","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1967.tb04246.x"},{"key":"ref52","article-title":"Open problem: The oracle complexity of convex optimization with limited memory","author":"woodworth","year":"2019","journal-title":"arXiv 1907 00762"},{"key":"ref10","article-title":"Qsparse-local-SGD: Distributed SGD with quantization, sparsification, and local computations","author":"basu","year":"2019","journal-title":"arXiv 1906 02367"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"journal-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"nemirovsky","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.61125"},{"key":"ref16","first-page":"2674","article-title":"Taming the wild: A unified analysis of hogwild-style algorithms","author":"de sa","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Introductory Lectures on Stochastic Optimization","year":"2017","author":"duchi","key":"ref17"},{"key":"ref18","article-title":"Optimality guarantees for distributed statistical estimation","author":"duchi","year":"2014","journal-title":"arXiv 1405 0782"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9000-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref3","article-title":"Distributed learning with sublinear communication","author":"acharya","year":"2019","journal-title":"arXiv 1902 11259"},{"key":"ref6","first-page":"7564","article-title":"cpSGD: Communication-efficient and differentially-private distributed SGD","author":"agarwal","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","first-page":"1","article-title":"Information-theoretic lower bounds on the oracle complexity of convex optimization","author":"agarwal","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2261296"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref49","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume":"70","author":"suresh","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref9","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","first-page":"163","article-title":"Fundamental limits of online and distributed algorithms for statistical learning and estimation","author":"shamir","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437584"},{"key":"ref48","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917684"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192188"},{"key":"ref41","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref43","article-title":"NUQSGD: Improved communication efficiency for data-parallel SGD via nonuniform quantization","author":"ramezani-kebrya","year":"2019","journal-title":"arXiv 1908 06077"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9409872\/09352768.pdf?arnumber=9352768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:13Z","timestamp":1652194453000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9352768\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":57,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3058663","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}