{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T05:51:35Z","timestamp":1780465895782,"version":"3.54.1"},"reference-count":48,"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\/100006785","name":"Google Research India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","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.3366086","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T20:10:23Z","timestamp":1708632623000},"page":"28-43","source":"Crossref","is-referenced-by-count":3,"title":["Continual Mean Estimation Under User-Level Privacy"],"prefix":"10.1109","volume":"5","author":[{"given":"Anand Jerry","family":"George","sequence":"first","affiliation":[{"name":"School of Computer and Communication Sciences, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lekshmi","family":"Ramesh","sequence":"additional","affiliation":[{"name":"Department of Statistics, Columbia University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4957-9370","authenticated-orcid":false,"given":"Aditya Vikram","family":"Singh","sequence":"additional","affiliation":[{"name":"Electrical Communication Engineering Department, Indian Institute of Science, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[{"name":"Electrical Communication Engineering Department, Indian Institute of Science, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.2257732","volume-title":"Identifying Participants in the Personal Genome Project by\n                        Name","author":"Sweeney","year":"2013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3287287"},{"key":"ref4","first-page":"263","article-title":"Bounding user contributions: A bias-variance\n                        trade-off in differential privacy","volume-title":"Proc.\n                        36th Int. Conf. Mach. Learn.","author":"Amin"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_34"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"ref7","first-page":"12466","article-title":"Learning with user-level\n                    privacy","volume-title":"Advances in Neural Information\n                        Processing Systems","volume":"34","author":"Levy","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2010.12"},{"key":"ref9","article-title":"The price of differential privacy under continual\n                        observation","author":"Jain","year":"2021","journal-title":"arXiv:2112.00828"},{"key":"ref10","first-page":"1","article-title":"Differential privacy in the streaming\n                        world","volume-title":"Proc. Simons Inst. Workshop Big\n                        Data Differ. Privacy","author":"Nikolov"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31680-7_8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448530"},{"key":"ref13","article-title":"Collecting telemetry data\n                    privately","volume-title":"Advance Neural Information\n                        Processing System","volume":"30","author":"Ding","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.718"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23535"},{"key":"ref16","first-page":"66","article-title":"Panprivate streaming\n                    algorithms","volume-title":"Proc. ICS","author":"Dwork"},{"key":"ref17","first-page":"20965","article-title":"Learning discrete distributions: User vs item-level\n                        privacy","volume-title":"Advances in Neural Information\n                        Processing Systems","volume":"33","author":"Liu","year":"2020"},{"key":"ref18","first-page":"1","article-title":"Mean estimation with user-level privacy under data\n                        heterogeneity","volume-title":"Proc. NeurIPS Workshop\n                        Privacy Mach. Learn.","author":"Cummings"},{"key":"ref19","first-page":"16383","article-title":"Tight and robust private mean estimation with few\n                        users","volume-title":"Proc. 39th Int. Conf. Mach.\n                        Learn.","author":"Narayanan"},{"key":"ref20","article-title":"User-level private learning via correlated\n                        sampling","author":"Ghazi","year":"2021","journal-title":"arXiv:2110.11208"},{"key":"ref21","article-title":"Discrete distribution estimation under user-level\n                        local differential privacy","author":"Acharya","year":"2022","journal-title":"arXiv:2211.03757"},{"key":"ref22","first-page":"2204","article-title":"Private mean estimation of heavy-tailed\n                        distributions","volume-title":"Proc. Conf. Learn.\n                        Theory","author":"Kamath"},{"key":"ref23","first-page":"1853","article-title":"Privately learning high-dimensional\n                        distributions","volume-title":"Proc. Conf. Learn.\n                        Theory","author":"Kamath"},{"key":"ref24","article-title":"A polynomial time, pure differentially private\n                        estimator for binary product distributions","author":"Singhal","year":"2023","journal-title":"arXiv:2304.06787"},{"key":"ref25","first-page":"14475","article-title":"Coinpress: Practical private mean and covariance\n                        estimation","volume-title":"Proc. 34th Conf. Neural Inf.\n                        Process. Syst.","author":"Biswas"},{"key":"ref26","first-page":"728","article-title":"Generalization for adaptively-chosen estimators via\n                        stable median","volume-title":"Proc. 30th Conf. Learn.\n                        Theory, (COLT)","author":"Feldman"},{"key":"ref27","first-page":"1","article-title":"Private hypothesis selection","volume-title":"Proc. 33rd Conf. Neural Inf. Process. Syst.","author":"Bun"},{"key":"ref28","first-page":"1","article-title":"Average-case averages: Private algorithms for smooth\n                        sensitivity and mean estimation","volume-title":"Proc.\n                        33rd Conf. Neural Inf. Process. Syst.","author":"Bun"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2058"},{"key":"ref30","article-title":"A primer on private\n                    statistics","author":"Kamath","year":"2020","journal-title":"arXiv:2005.00010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref32","first-page":"1161","article-title":"Lower bounds for locally private estimation via\n                        communication complexity","volume-title":"Proc. Conf.\n                        Learn. Theory","author":"Duchi"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053569"},{"key":"ref35","first-page":"1120","article-title":"Hadamard response: Estimating distributions\n                        privately, efficiently, and with little\n                    communication","volume-title":"Proc. 22nd Int. Conf. Artif.\n                        Intell. Statist.","author":"Acharya"},{"key":"ref36","article-title":"Unified lower bounds for interactive high-dimensional\n                        estimation under information constraints","author":"Acharya","year":"2020","journal-title":"arXiv:2010.06562"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123905"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3150\/19-BEJ1165"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039461"},{"key":"ref40","first-page":"3163","article-title":"Geometric lower bounds for distributed parameter\n                        estimation under communication constraints","volume-title":"Proc. Conf. Learn. Theory","author":"Han"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref42","article-title":"Distributed Gaussian mean estimation under\n                        communication constraints: Optimal rates and communication-efficient\n                        algorithms","author":"Cai","year":"2020","journal-title":"arXiv:2001.08877"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2167"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3174409"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3150599"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3325902"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10461668\/10443583.pdf?arnumber=10443583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:03:50Z","timestamp":1736543030000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10443583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3366086","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}