{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:28Z","timestamp":1740131668116,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Graduate Fellowship"},{"name":"Google Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tit.2024.3511624","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T18:50:54Z","timestamp":1733770254000},"page":"1376-1388","source":"Crossref","is-referenced-by-count":0,"title":["Better and Simpler Lower Bounds for Differentially Private Statistical Estimation"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2325-8923","authenticated-orcid":false,"given":"Shyam","family":"Narayanan","sequence":"first","affiliation":[{"name":"Citadel Securities, Miami, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/2976749.2978318"},{"key":"ref2","first-page":"48","article-title":"Differentially private assouad, fano, and le cam","volume-title":"Proc. 32nd Int. Conf. Algorithmic Learn. Theory","volume":"132","author":"Acharya"},{"key":"ref3","first-page":"185","article-title":"On the sample complexity of privately learning unbounded high-dimensional Gaussians","volume-title":"Proc. 32nd Int. Conf. Algorithmic Learn. Theory","author":"Aden-Ali"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/3564246.3585194"},{"key":"ref5","first-page":"14190","article-title":"Differentially private covariance estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Amin"},{"key":"ref6","first-page":"1075","article-title":"Private and polynomial time algorithms for learning Gaussians and beyond","volume-title":"Proc. Conf. Learn. Theory","author":"Ashtiani"},{"key":"ref7","article-title":"Privacy and statistical risk: Formalisms and minimax bounds","author":"Barber","year":"2014","journal-title":"arXiv:1412.4451"},{"key":"ref8","first-page":"11279","article-title":"Private stochastic convex optimization with optimal rates","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"32","author":"Bassily"},{"key":"ref9","first-page":"7950","article-title":"Covariance-aware private mean estimation without private covariance estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Brown"},{"key":"ref10","first-page":"5578","article-title":"Fast, sample-efficient, affine-invariant private mean and covariance estimation for subgaussian distributions","volume-title":"Proc. 36th Annu. Conf. Learn. Theory","author":"Brown"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.2021.3049802"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.29012\/jpc.655"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2591796.2591877"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1214\/21-AOS2058"},{"key":"ref15","article-title":"Score attack: A lower bound technique for optimal differentially private learning","author":"Cai","year":"2023","journal-title":"arXiv:2303.07152"},{"key":"ref16","article-title":"Optimal differentially private PCA and estimation for spiked covariance matrices","author":"Cai","year":"2024","journal-title":"arXiv:2401.03820"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1137\/040616413"},{"key":"ref18","first-page":"29139","article-title":"Mean estimation with user-level privacy under data heterogeneity","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Cummings"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/FOCS.2017.16"},{"key":"ref20","first-page":"850","article-title":"Differentially private covariance revisited","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dong"},{"key":"ref21","first-page":"2511","article-title":"A pretty fast algorithm for adaptive private mean estimation","volume-title":"Proc. 36th Annu. Conf. Learn. Theory","author":"Duchi"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/11681878_14"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/s00454-015-9678-x"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/FOCS.2015.46"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/1806689.1806786"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/FOCS.2014.55"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/3519935.3519947"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/3564246.3585115"},{"key":"ref29","first-page":"25993","article-title":"Instance-optimal mean estimation under differential privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref30","first-page":"1853","article-title":"Privately learning high-dimensional distributions","volume-title":"Proc. Int. Conf. Learn. Theory (PMLR)","author":"Kamath"},{"key":"ref31","first-page":"24405","article-title":"New lower bounds for private estimation and a generalized fingerprinting lemma","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"35","author":"Kamath"},{"key":"ref32","first-page":"544","article-title":"A private and computationally-efficient estimator for unbounded Gaussians","volume-title":"Proc. 35th Annu. Conf. Learn. Theory","author":"Kamath"},{"key":"ref33","first-page":"2204","article-title":"Private mean estimation of heavy-tailed distributions","volume-title":"Proc. Conf. Learn. Theory","author":"Kamath"},{"key":"ref34","article-title":"A primer on private statistics","author":"Kamath","year":"2020","journal-title":"arXiv:2005.00010"},{"key":"ref35","first-page":"9","article-title":"Finite sample differentially private confidence intervals","volume-title":"Proc. 9th Conf. Innov. Theor. Comput. Sci.","volume":"94","author":"Karwa"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/1806689.1806795"},{"key":"ref37","first-page":"723","article-title":"Private robust estimation by stabilizing convex relaxations","volume-title":"Proc. 35th Annu. Conf. Learn. Theory","author":"Kothari"},{"key":"ref38","first-page":"12466","article-title":"Learning with user-level privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Levy"},{"key":"ref39","first-page":"3887","article-title":"Robust and differentially private mean estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"34","author":"Liu"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1145\/1536414.1536466"},{"key":"ref41","first-page":"21:1","article-title":"Deterministic O(1)-approximation algorithms to 1-center clustering with outliers","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","volume":"116","author":"Narayanan","year":"2018"},{"key":"ref42","first-page":"16383","article-title":"Tight and robust private mean estimation with few users","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Narayanan"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1145\/2488608.2488652"},{"key":"ref44","article-title":"Smooth lower bounds for differentially private algorithms via padding-and-permuting fingerprinting codes","author":"Peter","year":"2023","journal-title":"arXiv:2307.07604"},{"key":"ref45","article-title":"Lower bounds for private estimation of Gaussian covariance matrices under all reasonable parameter regimes","author":"Portella","year":"2024","journal-title":"arXiv:2404.17714"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/ITA.2016.7888199"},{"issue":"2","key":"ref47","doi-asserted-by":"crossref","DOI":"10.29012\/jpc.v7i2.648","article-title":"Between pure and approximate differential privacy","volume":"7","author":"Steinke","year":"2016","journal-title":"J. Privacy Confidentiality"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/FOCS.2017.57"},{"key":"ref49","first-page":"21828","article-title":"Friendlycore: Practical differentially private aggregation","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Tsfadia"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1017\/9781108231596"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10851774\/10787127-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10851774\/10787127.pdf?arnumber=10787127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T06:04:49Z","timestamp":1737698689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10787127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3511624","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}