{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:42:41Z","timestamp":1782441761635,"version":"3.54.5"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-1841190"],"award-info":[{"award-number":["CCF-1841190"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2011255"],"award-info":[{"award-number":["CCF-2011255"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000735","name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tit.2023.3334024","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:55:59Z","timestamp":1700160959000},"page":"389-414","source":"Crossref","is-referenced-by-count":10,"title":["Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3509-1224","authenticated-orcid":false,"given":"Ankit","family":"Pensia","sequence":"first","affiliation":[{"name":"IBM Research, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4159-0900","authenticated-orcid":false,"given":"Varun","family":"Jog","sequence":"additional","affiliation":[{"name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6514-7834","authenticated-orcid":false,"given":"Po-Ling","family":"Loh","sequence":"additional","affiliation":[{"name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834363"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697590"},{"key":"ref3","first-page":"289","article-title":"A review of recent results on learning with finite memory","volume-title":"Proc. Int. Symp. Inf. Theory (ISIT)","author":"Hellman"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696958"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188962"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174505"},{"key":"ref7","first-page":"5061","article-title":"Streaming algorithms for high-dimensional robust statistics","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Diakonikolas"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref9","first-page":"17:1","article-title":"Extremal mechanisms for local differential privacy","volume":"17","author":"Kairouz","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316336"},{"key":"ref12","first-page":"1785","article-title":"Locally private hypothesis selection","volume-title":"Proc. Conf. Learn. Theory","author":"Gopi"},{"key":"ref13","first-page":"297","article-title":"Decentralized detection","volume-title":"Advances in Statistical Signal Processing","author":"Tsitsiklis","year":"1993"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3108952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref17","first-page":"1490","article-title":"Memory, communication, and statistical queries","volume-title":"Proc. Conf. Learn. Theory","author":"Steinhardt"},{"key":"ref18","first-page":"785","article-title":"A general characterization of the statistical query complexity","volume-title":"Proc. Conf. Learn. Theory","author":"Feldman"},{"key":"ref19","first-page":"1145","article-title":"Detecting correlations with little memory and communication","volume-title":"Proc. Conf. Learn. Theory","author":"Dagan"},{"key":"ref20","first-page":"1070","article-title":"Communication and memory efficient testing of discrete distributions","volume-title":"Proc. Conf. Learn. Theory","author":"Diakonikolas"},{"key":"ref21","first-page":"1161","article-title":"Lower bounds for locally private estimation via communication complexity","volume-title":"Proc. Conf. Learn. Theory","author":"Duchi"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref23","first-page":"1","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":"ref24","first-page":"24593","article-title":"Pointwise bounds for distribution estimation under communication constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/0100000114"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342363"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699803"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.272453"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3046674"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181979"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2004.07.002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/e20050383"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055015"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349553"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0125-7"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref42","first-page":"2962","article-title":"Robust hypothesis testing and distribution estimation in Hellinger distance","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Suresh"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123905"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2006.10.027"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133079"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059338"},{"key":"ref47","first-page":"948","article-title":"Sketching, embedding and dimensionality reduction in information theoretic spaces","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Abdullah"},{"key":"ref48","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0537-1","volume-title":"Decoupling","author":"de la Pe\u00f1a","year":"1999"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref50","first-page":"3229","article-title":"Simple binary hypothesis testing under local differential privacy and communication constraints","volume-title":"Proc. 36th Annu. Conf. Learn. Theory","author":"Pensia"},{"key":"ref51","volume-title":"Information Theory: From Coding to Learning","author":"Polyanskiy","year":"2023"},{"key":"ref52","article-title":"Optimality guarantees for distributed statistical estimation","author":"Duchi","year":"2014","journal-title":"arXiv:1405.0782"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/16M1078471"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1515\/9781400842902"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10375320\/10320342-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10375320\/10320342.pdf?arnumber=10320342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T01:48:08Z","timestamp":1705024088000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10320342\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":54,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3334024","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}