{"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":1774679683019,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1109\/tit.2021.3123905","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T19:59:47Z","timestamp":1635364787000},"page":"502-516","source":"Crossref","is-referenced-by-count":11,"title":["Interactive Inference Under Information Constraints"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2170-3015","authenticated-orcid":false,"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7153-5211","authenticated-orcid":false,"given":"Clement L.","family":"Canonne","sequence":"additional","affiliation":[]},{"given":"Yuhan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ziteng","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053569"},{"key":"ref2","first-page":"3","article-title":"Domain compression and its application to randomness-optimal distributed goodness-of-fit","volume-title":"Proc. 33rd Conf. Learn. Theory","volume":"125","author":"Acharya"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518069"},{"key":"ref4","article-title":"Distributed simulation and distributed inference","author":"Acharya","year":"2018","journal-title":"arXiv:1804.06952"},{"key":"ref5","first-page":"30","article-title":"Communication-constrained inference and the role of shared randomness","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Acharya"},{"key":"ref6","first-page":"3","article-title":"Inference under information constraints: Lower bounds from chi-square contraction","volume-title":"Proc. 32nd Conf. Learn. Theory","volume":"99","author":"Acharya"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref9","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Acharya"},{"key":"ref10","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Acharya"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.32388\/bz83sn"},{"key":"ref12","first-page":"183","article-title":"Pan-private uniformity testing","volume-title":"Proc. 33rd Conf. Learn. Theory","volume":"125","author":"Amin"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849821"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039461"},{"key":"ref15","first-page":"721","article-title":"Linear queries estimation with local differential privacy","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","volume":"89","author":"Bassily"},{"key":"ref16","first-page":"3164","article-title":"Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 33, Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Berrett"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00070"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384315"},{"key":"ref20","first-page":"15001","article-title":"Locally private learning without interaction requires separation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Daniely"},{"key":"ref21","first-page":"1070","article-title":"Communication and memory efficient testing of discrete distributions","volume-title":"Proc. 32nd Conf. Learn. Theory","volume":"99","author":"Diakonikolas"},{"key":"ref22","first-page":"6394","article-title":"Communication-efficient distributed learning of discrete distributions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Diakonikolas"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M"},{"key":"ref24","first-page":"1161","article-title":"Lower bounds for locally private estimation via communication complexity","volume-title":"Proc. 32nd Conf. Learn. Theory","volume":"99","author":"Duchi"},{"key":"ref25","article-title":"Local privacy, data processing inequalities, and statistical minimax rates","author":"Duchi","year":"2014","journal-title":"arXiv:1302.3203"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212772"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"issue":"1","key":"ref33","first-page":"5","article-title":"Distributed statistical estimation of high-dimensional and nonparametric distributions with communication constraints, February 2018","volume":"1","author":"Han","year":"2018","journal-title":"Talk Given at ITA"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3108952"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00015"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.31"},{"key":"ref37","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","volume":"48","author":"Kairouz"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928987"},{"key":"ref40","first-page":"163","article-title":"Fundamental limits of online and distributed algorithms for statistical learning and estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shamir"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.35"},{"key":"ref42","article-title":"Tight lower bounds for locally differentially private selection","author":"Ullman","year":"2018","journal-title":"arXiv:1802.02638"},{"key":"ref43","article-title":"Mutual information optimally local private discrete distribution estimation","author":"Wang","year":"2016","journal-title":"arXiv:1607.08025"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9660615\/09591593.pdf?arnumber=9591593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:52:51Z","timestamp":1705020771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9591593\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":44,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3123905","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]}}}