{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:53:30Z","timestamp":1745560410146,"version":"3.37.3"},"reference-count":145,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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":"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\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1641\/21","1766\/22"],"award-info":[{"award-number":["1641\/21","1766\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/jsait.2024.3481296","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T17:29:09Z","timestamp":1728926949000},"page":"623-644","source":"Crossref","is-referenced-by-count":2,"title":["Statistical Inference With Limited Memory: A Survey"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5174-5625","authenticated-orcid":false,"given":"Tomer","family":"Berg","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering - Systems, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-7923","authenticated-orcid":false,"given":"Or","family":"Ordentlich","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4321-0318","authenticated-orcid":false,"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering - Systems, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053569"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697590"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696958"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.42.12.920"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1069362732"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0125-7"},{"volume-title":"Theory of Point Estimation","year":"2006","author":"Lehmann","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252.013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS849"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412945"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548468"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851769"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90382-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055332"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(76)90456-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060621"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140295"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129117"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1798596.1798604"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934993"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238202"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597038"},{"key":"ref35","first-page":"720","article-title":"Tight lower bounds for selection in randomly ordered streams","volume-title":"Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Chakrabarti"},{"key":"ref36","article-title":"Estimating entropy of distributions in constant space","author":"Acharya","year":"2019","journal-title":"arXiv:1911.07976"},{"key":"ref37","article-title":"Estimation of entropy in constant space with improved sample complexity","author":"Aliakbarpour","year":"2022","journal-title":"arXiv:2205.09804"},{"key":"ref38","first-page":"167","article-title":"Optimal space lower bounds for all frequency moments","volume-title":"Proc. SODA","author":"Woodruff"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830749"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514928"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.2629"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF00057730"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347496"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/18.476308"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/18.720540"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162270"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/18.32118"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/18.119685"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2016.7746613"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778252"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2910065"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2953750"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039839"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620744"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437584"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316332"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913384"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/9781108671644"},{"key":"ref62","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":"ref63","first-page":"1","article-title":"On communication cost of distributed statistical estimation and dimensionality","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Garg"},{"key":"ref64","first-page":"3","article-title":"Domain compression and its application to randomness-optimal distributed goodness-of-fit","volume-title":"Proc. Conf. Learn. Theory","author":"Acharya"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2018.1429274"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3108952"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212772"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3028440"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3334024"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/18.490552"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/18.623151"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2897842"},{"volume-title":"Information Theory: From Coding to Learning","year":"2022","author":"Polyanskiy","key":"ref76"},{"article-title":"Efficient and private distance approximation in the communication and streaming models","year":"2007","author":"Woodruff","key":"ref77"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.93"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/2483699.2483706"},{"key":"ref80","first-page":"1","article-title":"Stochastic streams: Sample complexity vs. space complexity","volume-title":"Proc. 24th Annu. Eur. Symp. Algorithms (ESA)","author":"Crouch"},{"key":"ref81","first-page":"1145","article-title":"Detecting correlations with little memory and communication","volume-title":"Proc. Conf. Learn. Theory","author":"Dagan"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_15"},{"key":"ref83","article-title":"The information bottleneck method","author":"Tishby","year":"2000","journal-title":"arXiv:Phys.\/0004057"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991561"},{"key":"ref85","first-page":"1070","article-title":"Communication and memory efficient testing of discrete distributions","volume-title":"Proc. Conf. Learn. Theory","author":"Diakonikolas"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174331"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_16"},{"key":"ref88","first-page":"163","article-title":"Fundamental limits of online and distributed algorithms for statistical learning and estimation","volume-title":"Proc. 27th Int. Conf. Neural Inf. Process. Syst.","author":"Shamir"},{"key":"ref89","first-page":"1490","article-title":"Memory, communication, and statistical queries","volume-title":"Proc. Conf. Learn. Theory","author":"Steinhardt"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174505"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/3186563"},{"key":"ref92","first-page":"566","article-title":"Deterministic finite-memory bias estimation","volume-title":"Proc. Conf. Learn. Theory","author":"Berg"},{"key":"ref93","first-page":"3506","article-title":"On the memory complexity of uniformity testing","volume-title":"Proc. Conf. Learn. Theory","author":"Berg"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797609"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104992"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054853"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706278"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699897"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177698038"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693334"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054846"},{"key":"ref103","first-page":"289","article-title":"A review of recent results on learning with finite memory","volume-title":"Proc. 2nd Int. Symp. Inf. Theory","author":"Hellman"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055082"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055430"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.73"},{"key":"ref107","article-title":"Memory-sample lower bounds for learning parity with noise","author":"Garg","year":"2021","journal-title":"arXiv:2107.02320"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054427"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054918"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054820"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054536"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055080"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055229"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055081"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057250"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7152(89)90016-3"},{"issue":"36","key":"ref117","first-page":"5","article-title":"13. various techniques used in connection with random digits","volume":"12","author":"Von Neumann","year":"1951","journal-title":"Appl. Math Ser"},{"key":"ref118","first-page":"1564","article-title":"Minimax rates for memory-bounded sparse linear regression","volume-title":"Proc. Conf. Learn. Theory","author":"Steinhardt"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316403"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437851"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-011-9293-5"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/18.243445"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/18.256496"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838151"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281478"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43662-9_10"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_9"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928987"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.123"},{"key":"ref131","first-page":"1","article-title":"Comparison graphs: A unified method for uniformity testing","volume-title":"Proc. 12th Innovat. Theor. Comput. Sci. Conf. (ITCS)","author":"Meir"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977936.37"},{"key":"ref133","first-page":"1","article-title":"Sample-optimal identity testing with high probability","volume-title":"Proc. 45th Int. Colloq. Automata, Lang., Program. (ICALP)","author":"Diakonikolas"},{"key":"ref134","article-title":"Testing properties of distributions in the streaming model","author":"Roy","year":"2023","journal-title":"arXiv:2309.03245"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422497"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1137\/130945508"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1137\/1104033"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833360"},{"key":"ref139","first-page":"179","article-title":"A CLT and tight lower bounds for estimating entropy","volume-title":"Proc. Electron. Colloq. Comput. Complex.","author":"Valiant"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.81"},{"key":"ref142","first-page":"251","article-title":"Space-efficient estimation of robust statistics and distribution testing","volume-title":"Proc. ICS","author":"Chien"},{"volume-title":"Memory complexity of estimating entropy and mutual information","author":"Berg","key":"ref143"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"ref145","article-title":"Optimal bounds for approximate counting","author":"Nelson","year":"2020","journal-title":"arXiv:2010.02116"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/10461668\/10716744.pdf?arnumber=10716744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:05:04Z","timestamp":1736543104000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10716744\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":145,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3481296","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2024]]}}}