{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:30:48Z","timestamp":1774629048899,"version":"3.50.1"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["NeTS-1817205"],"award-info":[{"award-number":["NeTS-1817205"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2213223"],"award-info":[{"award-number":["CCF-2213223"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005492","name":"Stanford Graduate Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005492","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google Research Award","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tit.2022.3218772","type":"journal-article","created":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T20:42:06Z","timestamp":1668026526000},"page":"1261-1281","source":"Crossref","is-referenced-by-count":29,"title":["Breaking the Communication-Privacy-Accuracy Trilemma"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7355-9487","authenticated-orcid":false,"given":"Wei-Ning","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[{"name":"Google Research, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"693","article-title":"Hogwild! A lock-free approach to parallelizing stochastic gradient descent","volume-title":"Proc. 24th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Niu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2283137"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref7","article-title":"Protection against reconstruction and its applications in private federated learning","author":"Bhowmick","year":"2018","journal-title":"arXiv:1812.00984"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3161620"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006630"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746632"},{"key":"ref11","first-page":"2328","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref12","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Suresh"},{"key":"ref13","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Acharya"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.151"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"ref16","article-title":"Encode, shuffle, analyze privacy revisited: Formalizations and empirical evaluation","author":"Erlingsson","year":"2020","journal-title":"arXiv:2001.03618"},{"key":"ref17","first-page":"2285","article-title":"Practical locally private heavy hitters","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Bassily"},{"key":"ref18","first-page":"7564","article-title":"cpSGD: Communication-efficient and differentially-private distributed SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Agarwal"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref20","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Alistarh","year":"2017"},{"key":"ref21","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":"ref22","first-page":"9850","article-title":"ATOMO: Communication-efficient learning via atomic sparsification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3042094"},{"key":"ref24","first-page":"1299","article-title":"Gradient sparsification for communication-efficient distributed optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wangni"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048458"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190120"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483364"},{"key":"ref29","article-title":"Expanding the reach of federated learning by reducing client resource requirements","author":"Caldas","year":"2018","journal-title":"arXiv:1812.07210"},{"key":"ref30","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":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.82"},{"key":"ref32","article-title":"Collecting and analyzing data from smart device users with local differential privacy","author":"Nguy\u00ean","year":"2016","journal-title":"arXiv:1606.05053"},{"key":"ref33","article-title":"Locally differentially private data collection and analysis","author":"Wang","year":"2019","journal-title":"arXiv:1906.01777"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref35","first-page":"729","article-title":"Locally differentially private protocols for frequency estimation","volume-title":"Proc. 26th USENIX Secur. Symp. (USENIX Security)","author":"Wang"},{"key":"ref36","first-page":"1054","article-title":"RAPPOR: Randomized aggregatable privacy-preserving ordinal response","volume-title":"Proc. 21st ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Pihur"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978409"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196981"},{"key":"ref40","first-page":"1","article-title":"Breaking the communication-privacy-accuracy trilemma","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen"},{"key":"ref41","article-title":"Lossless compression of efficient private local randomizers","author":"Feldman","year":"2021","journal-title":"arXiv:2102.12099"},{"key":"ref42","article-title":"Mutual information optimally local private discrete distribution estimation","author":"Wang","year":"2016","journal-title":"arXiv:1607.08025"},{"key":"ref43","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","volume":"48","author":"Kairouz"},{"key":"ref44","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Acharya"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3108952"},{"key":"ref48","first-page":"2726","article-title":"On communication cost of distributed statistical estimation and dimensionality","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Garg"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"issue":"1","key":"ref50","first-page":"9583","article-title":"Lower bounds for learning distributions under communication constraints via Fisher information","volume":"21","author":"Barnes","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039461"},{"issue":"1","key":"ref52","first-page":"492","article-title":"Extremal mechanisms for local differential privacy","volume":"17","author":"Kairouz","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282864"},{"key":"ref55","first-page":"46","article-title":"Without-replacement sampling for stochastic gradient methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Shamir"},{"key":"ref56","first-page":"4703","article-title":"SGD without replacement: Sharper rates for general smooth convex functions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nagaraj"},{"key":"ref57","first-page":"7964","article-title":"Closing the convergence gap of SGD without replacement","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rajput"},{"key":"ref58","first-page":"17526","article-title":"SGD with shuffling: Optimal rates without component convexity and large epoch requirements","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Ahn"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518124"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2666468"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref65","first-page":"1","article-title":"Private stochastic convex optimization with optimal rates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Bassily"},{"key":"ref66","first-page":"4381","article-title":"Stability of stochastic gradient descent on nonsmooth convex losses","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Bassily"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384335"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10024105\/9944378-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10024105\/09944378.pdf?arnumber=9944378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:10:03Z","timestamp":1706753403000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9944378\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":67,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3218772","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}