{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:43Z","timestamp":1774679683807,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"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":["CCF-1846300"],"award-info":[{"award-number":["CCF-1846300"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1815893"],"award-info":[{"award-number":["CCF-1815893"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google Faculty Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Goldstine Postdoctoral Fellowship at IBM"},{"DOI":"10.13039\/100005492","name":"Motwani Postdoctoral Fellowship at Stanford University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005492","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011993","name":"Research Grant from the Robert Bosch Center for Cyberphysical Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011993","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tit.2020.3028439","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T20:38:41Z","timestamp":1601671121000},"page":"7856-7877","source":"Crossref","is-referenced-by-count":26,"title":["Inference Under Information Constraints II: Communication Constraints and Shared Randomness"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2170-3015","authenticated-orcid":false,"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7153-5211","authenticated-orcid":false,"given":"Clement L.","family":"Canonne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"ref33","first-page":"3163","article-title":"Geometric lower bounds for distributed parameter estimation under communication constraints","volume":"75","author":"han","year":"2018","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"2300","DOI":"10.1109\/18.720540","article-title":"Statistical inference under multiterminal data compression","volume":"44","author":"sun han","year":"1998","journal-title":"IEEE Trans Inf Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057383"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9267-y"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483335"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283266"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250852"},{"key":"ref28","first-page":"152","article-title":"The uniform distribution is complete with respect to testing identity to a fixed distribution","volume":"12050","author":"goldreich","year":"2020","journal-title":"Computational Complexity and Property Testing-On the Interplay Between Randomness and Computation"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.65"},{"key":"ref29","article-title":"On testing expansion in bounded-degree graphs","author":"goldreich","year":"2000"},{"key":"ref2","first-page":"2067","article-title":"Test without trust: Optimal locally private distribution testing","author":"acharya","year":"2019","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref1","article-title":"Inference under information constraints III: Local privacy constraints","author":"acharya","year":"2019","journal-title":"arXiv 1808 02174"},{"key":"ref20","first-page":"2728","article-title":"Non interactive simulation of correlated distributions is decidable","author":"de","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref22","first-page":"6394","article-title":"Communication-efficient distributed learning of discrete distributions","author":"diakonikolas","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"41","article-title":"Sample-optimal identity testing with high probability","volume":"107","author":"diakonikolas","year":"2018","journal-title":"Proc 45th Int Colloq Automata Lang Program"},{"key":"ref24","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"2013","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.78"},{"key":"ref26","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":"ref25","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"gacs","year":"1973","journal-title":"Problems Control Inf Theory"},{"key":"ref50","first-page":"6009","article-title":"Distributed nonparametric regression under communication constraints","author":"zhu","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959920"},{"key":"ref11","article-title":"The optimality of correlated sampling","author":"bavarian","year":"2016","journal-title":"arXiv 1612 01041"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928987"},{"key":"ref12","first-page":"28","article-title":"Distribution testing lower bounds via reductions from communication complexity","volume":"79","author":"blais","year":"2017","journal-title":"Conf on Computational Complexity"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3305270"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref16","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc Compress Complex (SEQUENCES)"},{"key":"ref17","first-page":"9","article-title":"A survey on distribution testing: Your data is big. But is it blue?","author":"canonne","year":"2020","journal-title":"Theory of Computing Library"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9785-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.88"},{"key":"ref4","first-page":"3577","article-title":"Optimal testing for properties of distributions","author":"acharya","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst 28"},{"key":"ref3","article-title":"Inference under information constraints I: Lower bounds from chi-square contraction","author":"acharya","year":"2018","journal-title":"arXiv 1812 11476"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"ref5","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume":"89","author":"acharya","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOAS1155SF"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a015"},{"key":"ref49","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":"ref9","first-page":"26","article-title":"Distributed learning, communication complexity and privacy","volume":"23","author":"balcan","year":"2012","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3170708"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/151002526"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2331042.2331052"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.14"},{"key":"ref43","article-title":"Adaptive distributed methods under communication constraints","author":"szabo","year":"2018","journal-title":"arXiv 1804 00864"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9266290\/09211522.pdf?arnumber=9211522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:21:10Z","timestamp":1651080070000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9211522\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":50,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3028439","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}