{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:19:33Z","timestamp":1773436773850,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["ONR N00014-18-1-2191"],"award-info":[{"award-number":["ONR N00014-18-1-2191"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2134248"],"award-info":[{"award-number":["DMS-2134248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-2037304"],"award-info":[{"award-number":["ECCS-2037304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office Early Career Award","doi-asserted-by":"publisher","award":["W911NF-21-1-0242"],"award-info":[{"award-number":["W911NF-21-1-0242"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005801","name":"Facebook Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004344","name":"Adobe Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004344","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015269","name":"Stanford SystemX Alliance","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015269","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/jsait.2022.3198412","type":"journal-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T15:55:27Z","timestamp":1660578927000},"page":"183-196","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Randomized Subspace Embeddings for Distributed Optimization Under a Communication Budget"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7863-9811","authenticated-orcid":false,"given":"Rajarshi","family":"Saha","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0870-9992","authenticated-orcid":false,"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5686-800X","authenticated-orcid":false,"given":"Andrea J.","family":"Goldsmith","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","author":"grant","year":"2014","journal-title":"CVX Matlab Software for Disciplined Convex Programming Version 2 1"},{"key":"ref32","article-title":"The convergence of Sparsified gradient methods","volume":"31","author":"alistarh","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref31","author":"nesterov","year":"2014","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1967.tb04246.x"},{"key":"ref35","author":"krizhevsky","year":"2009","journal-title":"Cifar-10 (canadian institute for advanced research)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048458"},{"key":"ref11","first-page":"3329","article-title":"Distributed mean estimation with limited communication","author":"suresh","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5706"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2599482"},{"key":"ref14","first-page":"559","article-title":"signSGD: Compressed optimisation for non-convex problems","author":"bernstein","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref15","first-page":"3252","article-title":"Error feedback fixes signSGD and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref16","first-page":"1509","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","volume":"30","author":"wen","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref17","first-page":"2197","article-title":"vqSGD: Vector quantized stochastic gradient descent","author":"gandikota","year":"2021","journal-title":"Proc 24th Int Conf Artif Intell Stat"},{"key":"ref18","first-page":"4452","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref19","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"wangni","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9000-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981904"},{"key":"ref27","article-title":"Democratic representations","author":"studer","year":"2014","journal-title":"arXiv 1401 3420"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518254"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118428"},{"key":"ref8","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient Quantization and encoding","volume":"30","author":"alistarh","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref7","first-page":"1399","article-title":"RATQ: A universal fixed-length quantizer for stochastic optimization","author":"mayekar","year":"2020","journal-title":"Proc 23rd Int Conf Artif Intell Stat"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300004083"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174075"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1070\/IM1977v011n02ABEH001719"},{"key":"ref24","article-title":"Expanding the reach of federated learning by reducing client resource requirements","author":"caldas","year":"2018","journal-title":"arXiv 1812 07210"},{"key":"ref23","first-page":"3312","article-title":"Breaking the communication-privacy-accuracy trilemma","author":"chen","year":"2020","journal-title":"Proc Neural Inf Process Syst (NeurIPS)"},{"key":"ref26","article-title":"Minimax optimal quantization of linear models: Information-theoretic limits and efficient algorithms","author":"saha","year":"2022","journal-title":"arXiv 2202 11277"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaab006"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9953899\/9857556-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9953899\/09857556.pdf?arnumber=9857556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:56:21Z","timestamp":1773431781000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9857556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2022.3198412","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}