{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:35:40Z","timestamp":1768106140004,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"HKRGC","award":["16201819, 16205420, and 16205422"],"award-info":[{"award-number":["16201819, 16205420, and 16205422"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588669","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Universal Private Estimators"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4125","authenticated-orcid":false,"given":"Wei","family":"Dong","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2178-3716","authenticated-orcid":false,"given":"Ke","family":"Yi","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ishaq Aden-Ali Hassan Ashtiani and Gautam Kamath. 2021. On the sample complexity of privately learning unbounded high-dimensional gaussians. In Algorithmic Learning Theory. PMLR 185--216."},{"key":"e_1_3_2_1_2_1","volume-title":"Andr\u00e9s Munoz Medina, and Sergei Vassilvitskii","author":"Amin Kareem","year":"2019","unstructured":"Kareem Amin, Travis Dick, Alex Kulesza, Andr\u00e9s Munoz Medina, and Sergei Vassilvitskii. 2019a. Differentially Private Covariance Estimation.. In NeurIPS. 14190--14199."},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Machine Learning. PMLR, 263--271","author":"Amin Kareem","year":"2019","unstructured":"Kareem Amin, Alex Kulesza, Andres Munoz, and Sergei Vassilvtiskii. 2019b. Bounding user contributions: A bias-variance trade-off in differential privacy. In International Conference on Machine Learning. PMLR, 263--271."},{"key":"e_1_3_2_1_4_1","first-page":"17455","article-title":"Differentially private learning with adaptive clipping","volume":"34","author":"Andrew Galen","year":"2021","unstructured":"Galen Andrew, Om Thakkar, Brendan McMahan, and Swaroop Ramaswamy. 2021. Differentially private learning with adaptive clipping. Advances in Neural Information Processing Systems , Vol. 34 (2021), 17455--17466.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_5_1","unstructured":"Myrto Arapinis Diego Figueira and Marco Gaboardi. 2016. Sensitivity of Counting Queries. In International Colloquium on Automata Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_6_1","volume-title":"Conference on Learning Theory. PMLR, 1075--1076","author":"Ashtiani Hassan","year":"2022","unstructured":"Hassan Ashtiani and Christopher Liaw. 2022. Private and polynomial time algorithms for learning gaussians and beyond. In Conference on Learning Theory. PMLR, 1075--1076."},{"key":"e_1_3_2_1_7_1","volume-title":"Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. Advances in neural information processing systems","author":"Asi Hilal","year":"2020","unstructured":"Hilal Asi and John C Duchi. 2020. Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. Advances in neural information processing systems , Vol. 33 (2020)."},{"key":"e_1_3_2_1_8_1","unstructured":"Borja Balle Gilles Barthe and Marco Gaboardi. 2018. Privacy amplification by subsampling: Tight analyses via couplings and divergences. In Advances in Neural Information Processing Systems. 6277--6287."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_26"},{"key":"e_1_3_2_1_10_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Beimel Amos","unstructured":"Amos Beimel, Kobbi Nissim, and Uri Stemmer. 2013. Private learning and sanitization: Pure vs. approximate differential privacy. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 363--378."},{"key":"e_1_3_2_1_11_1","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Biswas Sourav","year":"2020","unstructured":"Sourav Biswas, Yihe Dong, Gautam Kamath, and Jonathan Ullman. 2020. CoinPress: Practical Private Mean and Covariance Estimation. Advances in Neural Information Processing Systems , Vol. 33 (2020)."},{"key":"e_1_3_2_1_12_1","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Brown Gavin","year":"2021","unstructured":"Gavin Brown, Marco Gaboardi, Adam Smith, Jonathan Ullman, and Lydia Zakynthinou. 2021. Covariance-aware private mean estimation without private covariance estimation. Advances in Neural Information Processing Systems , Vol. 34 (2021)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188946"},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Bun Mark","year":"2019","unstructured":"Mark Bun, Gautam Kamath, Thomas Steinke, and Steven Z Wu. 2019. Private hypothesis selection. Advances in Neural Information Processing Systems , Vol. 32 (2019)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840747"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.45"},{"key":"e_1_3_2_1_17_1","volume-title":"Advances in Neural Information Processing Systems 32 (NeurIPS '19). Curran Associates","author":"Bun Mark","unstructured":"Mark Bun and Thomas Steinke. 2019. Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation. In Advances in Neural Information Processing Systems 32 (NeurIPS '19). Curran Associates, Inc., 181--191."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2058"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.150"},{"key":"e_1_3_2_1_20_1","article-title":"A Near-Optimal Algorithm for Differentially-Private Principal Components","volume":"14","author":"Chaudhuri Kamalika","year":"2013","unstructured":"Kamalika Chaudhuri, Anand D Sarwate, and Kaushik Sinha. 2013. A Near-Optimal Algorithm for Differentially-Private Principal Components. Journal of Machine Learning Research , Vol. 14 (2013).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_21_1","volume-title":"Theory of cryptography conference","author":"Anindya De.","unstructured":"Anindya De. 2012. Lower bounds in differential privacy. In Theory of cryptography conference. Springer, 321--338."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517844"},{"key":"e_1_3_2_1_23_1","volume-title":"arXiv preprint arXiv:2205.14324","author":"Dong Wei","year":"2022","unstructured":"Wei Dong, Yuting Liang, and Ke Yi. 2022b. Differentially Private Covariance Revisited. arXiv preprint arXiv:2205.14324 (2022)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452813"},{"key":"e_1_3_2_1_25_1","volume-title":"Universal Private Estimators. arXiv preprint arXiv:2111.02598","author":"Dong Wei","year":"2021","unstructured":"Wei Dong and Ke Yi. 2021b. Universal Private Estimators. arXiv preprint arXiv:2111.02598 (2021)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3524143"},{"key":"e_1_3_2_1_27_1","volume-title":"Conference on Learning Theory. PMLR, 1161--1191","author":"Duchi John","year":"2019","unstructured":"John Duchi and Ryan Rogers. 2019. Lower bounds for locally private estimation via communication complexity. In Conference on Learning Theory. PMLR, 1161--1191."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_3_2_1_31_1","volume-title":"Theory of cryptography conference","author":"Dwork Cynthia","unstructured":"Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. Springer, 265--284."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_1_33_1","volume-title":"Foundations and Trends\u00ae in Theoretical Computer Science","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591883"},{"key":"e_1_3_2_1_35_1","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 2545--2554","author":"Gaboardi Marco","year":"2019","unstructured":"Marco Gaboardi, Ryan Rogers, and Or Sheffet. 2019. Locally Private Mean Estimation: $ Z $-test and Tight Confidence Intervals. In The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 2545--2554."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519947"},{"key":"e_1_3_2_1_38_1","volume-title":"Instance-optimal Mean Estimation Under Differential Privacy. Advances in Neural Information Processing Systems","author":"Huang Ziyue","year":"2021","unstructured":"Ziyue Huang, Yuting Liang, and Ke Yi. 2021. Instance-optimal Mean Estimation Under Differential Privacy. Advances in Neural Information Processing Systems (2021)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3177733"},{"key":"e_1_3_2_1_40_1","first-page":"2984","article-title":"Locally Private Gaussian Estimation","volume":"32","author":"Joseph Matthew","year":"2019","unstructured":"Matthew Joseph, Janardhan Kulkarni, Jieming Mao, and Steven Z Wu. 2019. Locally Private Gaussian Estimation. Advances in Neural Information Processing Systems , Vol. 32 (2019), 2984--2993.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of the 32nd Annual Conference on Learning Theory (COLT '19)","author":"Kamath Gautam","year":"2019","unstructured":"Gautam Kamath, Jerry Li, Vikrant Singhal, and Jonathan Ullman. 2019. Privately Learning High-Dimensional Distributions. In Proceedings of the 32nd Annual Conference on Learning Theory (COLT '19). 1853--1902."},{"key":"e_1_3_2_1_42_1","volume-title":"Conference on Learning Theory. PMLR, 544--572","author":"Kamath Gautam","year":"2022","unstructured":"Gautam Kamath, Argyris Mouzakis, Vikrant Singhal, Thomas Steinke, and Jonathan Ullman. 2022. A private and computationally-efficient estimator for unbounded gaussians. In Conference on Learning Theory. PMLR, 544--572."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244945"},{"key":"e_1_3_2_1_44_1","volume-title":"Conference on Learning Theory. PMLR, 2204--2235","author":"Kamath Gautam","year":"2020","unstructured":"Gautam Kamath, Vikrant Singhal, and Jonathan Ullman. 2020b. Private mean estimation of heavy-tailed distributions. In Conference on Learning Theory. PMLR, 2204--2235."},{"key":"e_1_3_2_1_45_1","volume-title":"Finite Sample Differentially Private Confidence Intervals. In 9th Innovations in Theoretical Computer Science Conference (ITCS","author":"Karwa Vishesh","year":"2018","unstructured":"Vishesh Karwa and Salil Vadhan. 2018. Finite Sample Differentially Private Confidence Intervals. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_46_1","volume-title":"Conference on Learning Theory. PMLR, 723--777","author":"Kothari Pravesh","year":"2022","unstructured":"Pravesh Kothari, Pasin Manurangsi, and Ameya Velingker. 2022. Private robust estimation by stabilizing convex relaxations. In Conference on Learning Theory. PMLR, 723--777."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342274"},{"key":"e_1_3_2_1_48_1","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Liu Xiyang","year":"2021","unstructured":"Xiyang Liu, Weihao Kong, Sham Kakade, and Sewoong Oh. 2021. Robust and differentially private mean estimation. Advances in Neural Information Processing Systems , Vol. 34 (2021)."},{"key":"e_1_3_2_1_49_1","volume-title":"Conference on Learning Theory. PMLR, 1167--1246","author":"Liu Xiyang","year":"2022","unstructured":"Xiyang Liu, Weihao Kong, and Sewoong Oh. 2022. Differential privacy and robust statistics in high dimensions. In Conference on Learning Theory. PMLR, 1167--1246."},{"key":"e_1_3_2_1_50_1","volume-title":"Learning differentially private recurrent language models. arXiv preprint arXiv:1710.06963","author":"McMahan H Brendan","year":"2017","unstructured":"H Brendan McMahan, Daniel Ramage, Kunal Talwar, and Li Zhang. 2017. Learning differentially private recurrent language models. arXiv preprint arXiv:1710.06963 (2017)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"e_1_3_2_1_52_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation. 149--162","author":"Narayan Arjun","year":"2012","unstructured":"Arjun Narayan and Andreas Haeberlen. 2012. DJoin: Differentially private join queries over distributed databases. In USENIX Symposium on Operating Systems Design and Implementation. 149--162."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Catuscia Palamidessi and Marco Stronati. 2012. Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems. In QAPL.","DOI":"10.4204\/EPTCS.85.7"},{"key":"e_1_3_2_1_55_1","volume-title":"Felix X Yu, Sashank J Reddi, and Sanjiv Kumar.","author":"Pichapati Venkatadheeraj","year":"2019","unstructured":"Venkatadheeraj Pichapati, Ananda Theertha Suresh, Felix X Yu, Sashank J Reddi, and Sanjiv Kumar. 2019. AdaCliP: Adaptive clipping for private SGD. arXiv preprint arXiv:1908.07643 (2019)."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732300"},{"key":"e_1_3_2_1_57_1","volume-title":"International Conference on Machine Learning. PMLR, 3105--3114","author":"Sheffet Or","year":"2017","unstructured":"Or Sheffet. 2017. Differentially private ordinary least squares. In International Conference on Machine Learning. PMLR, 3105--3114."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993743"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389762"},{"key":"e_1_3_2_1_60_1","volume-title":"Conference on Learning Theory. PMLR, 819--850","author":"Thakurta Abhradeep Guha","year":"2013","unstructured":"Abhradeep Guha Thakurta and Adam Smith. 2013. Differentially private feature selection via stability arguments, and the robustness of the lasso. In Conference on Learning Theory. PMLR, 819--850."},{"key":"e_1_3_2_1_61_1","unstructured":"Jalaj Upadhyay. 2018. The Price of Privacy for Low-rank Factorization. In NeurIPS."},{"key":"e_1_3_2_1_62_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Vadhan Salil","unstructured":"Salil Vadhan. 2017. The complexity of differential privacy. In Tutorials on the Foundations of Cryptography. Springer, 347--450. io"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588669","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:28Z","timestamp":1750178788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":62,"alternative-id":["10.1145\/3584372.3588669","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588669","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}