{"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":1774679683804,"version":"3.50.1"},"reference-count":58,"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-CCF","doi-asserted-by":"publisher","award":["NSF-CCF-1846300 (CAREER)"],"award-info":[{"award-number":["NSF-CCF-1846300 (CAREER)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF-CCF","doi-asserted-by":"publisher","award":["NSF-CCF-1815893"],"award-info":[{"award-number":["NSF-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"}]},{"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\/100007780","name":"Research Grant from the Robert Bosch Center for Cyberphysical Systems (RBCCPS), Indian Institute of Science, Bengaluru","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007780","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.3028440","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T20:38:41Z","timestamp":1601671121000},"page":"7835-7855","source":"Crossref","is-referenced-by-count":35,"title":["Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction"],"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","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731569"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"ref33","article-title":"Geometric lower bounds for distributed parameter estimation under communication constraints","author":"han","year":"2018","journal-title":"arXiv 1802 08417"},{"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","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","volume":"48","author":"kairouz","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref36","first-page":"384","article-title":"A minimax test of nonparametric hypotheses on the density of a distribution in $L_{p}$\n metrics","volume":"31","author":"ingster","year":"1986","journal-title":"Teor Veroyatnost i Primenen"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1930-1501565-9"},{"key":"ref34","first-page":"3163","article-title":"Geometric lower bounds for distributed parameter estimation under communication constraints","volume":"75","author":"han","year":"2018","journal-title":"Proc 31st Conf Learn Theory COLT"},{"key":"ref28","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":"ref27","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7_1","article-title":"A mathematical introduction to compressive sensing","author":"foucart","year":"2013","journal-title":"Applied and Numerical Harmonic Analysis"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43662-9_10"},{"key":"ref2","first-page":"2067","article-title":"Test without trust: Optimal locally private distribution testing","volume":"89","author":"acharya","year":"2019","journal-title":"Proc Machine Learning Research AISTATS"},{"key":"ref1","article-title":"Inference under information constraints III: Local privacy constraints","author":"acharya","year":"2019","journal-title":"arXiv 2007 10979"},{"key":"ref20","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":"ref22","article-title":"Distance-based and continuum Fano inequalities with applications to statistical estimation","author":"duchi","year":"2013","journal-title":"arXiv 1311 2669"},{"key":"ref21","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":"ref24","first-page":"785","article-title":"A general characterization of the statistical query complexity","volume":"65","author":"feldman","year":"2017","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212772"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3046674"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/151002526"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/5.554208"},{"key":"ref58","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":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620744"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2016.7746613"},{"key":"ref52","article-title":"Mutual information optimally local private discrete distribution estimation","author":"wang","year":"2016","journal-title":"arXiv 1607 08025"},{"key":"ref10","first-page":"246","article-title":"Statistical windows in testing for the initial distribution of a reversible Markov chain","volume":"89","author":"berthet","year":"2019","journal-title":"Proc AISTATS"},{"key":"ref11","first-page":"28:1","article-title":"Distribution testing lower bounds via reductions from communication complexity","volume":"79","author":"blais","year":"2017","journal-title":"Conf on Computational Complexity"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1122001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3305270"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref15","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 Graduate Surveys"},{"key":"ref16","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref18","article-title":"Learning structured distributions","author":"diakonikolas","year":"2016","journal-title":"Big Data Handbook"},{"key":"ref19","first-page":"1070","article-title":"Communication and memory efficient testing of discrete distributions","volume":"99","author":"diakonikolas","year":"2019","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref4","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume":"89","author":"acharya","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref3","article-title":"Inference under information constraints II: Communication constraints and shared randomness","author":"acharya","year":"2019","journal-title":"arXiv 1905 08302"},{"key":"ref6","first-page":"15","article-title":"Two party distribution testing: Communication and security","volume":"132","author":"andoni","year":"2019","journal-title":"Proc 46th Int Colloq Automata Lang Program LIPIcs"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOAS1155SF"},{"key":"ref49","first-page":"297","article-title":"Decentralized detection","volume":"2","author":"tsitsiklis","year":"1993","journal-title":"Advances in Statistical Signal Processing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"ref46","first-page":"4612","article-title":"Locally private hypothesis testing","volume":"80","author":"sheffet","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref45","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":"ref48","doi-asserted-by":"publisher","DOI":"10.4064\/sm-58-2-197-208"},{"key":"ref47","first-page":"1490","article-title":"Memory, communication, and statistical queries","volume":"49","author":"steinhardt","year":"2016","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref42","author":"pollard","year":"2003","journal-title":"Asymptopia"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928987"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437584"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2331042.2331052"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9266290\/09211418.pdf?arnumber=9211418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:22:43Z","timestamp":1651080163000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9211418\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":58,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3028440","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}