The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Local Privacy and Statistical Minimax Rates
Abstract
Working under local differential privacy-a model of privacy in which data remains private even from the statistician or learner-we study the tradeoff between privacy guarantees and the utility of the resulting statistical estimators. We prove bounds on information-theoretic quantities, including mutual information and Kullback-Leibler divergence, that influence estimation rates as a function of the amount of privacy preserved. When combined with minimax techniques such as Le Cam's and Fano's methods, these inequalities allow for a precise characterization of statistical rates under local privacy constraints. In this paper, we provide a treatment of two canonical problem families: mean estimation in location family models and convex risk minimization. For these families, we provide lower and upper bounds for estimation of population quantities that match up to constant factors, giving privacy-preserving mechanisms and computationally efficient estimators that achieve the bounds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Research works printed but not linked: 25
- 10.1145/293347.293351 · DOI · Paper page
- 10.1145/1806689.1806786 · DOI · Paper page
- 10.1137/090756090 · DOI · Paper page
- hall, 2011, Random Differential Privacy
- 10.1109/FOCS.2010.85 · DOI · Paper page
- 10.1145/773153.773174 · DOI · Paper page
- fienberg, 2010, Differential privacy and the risk-utility tradeoff for multidimensional contingency tables, The International Conference on Privacy in Statistical Databases, 10.1007/978-3-642-15838-4_17 · DOI
- 10.1109/FOCS.2010.12 · DOI · Paper page
- nemirovski, 1983, Problem Complexity and Method Efficiency in Optimization
- 10.1109/FOCS.2010.14 · DOI
- 10.1145/1993636.1993743 · DOI
- tsybakov, 2009, Introduction to Nonparametric Estimation, 10.1007/b13794 · DOI · Paper page
- 10.1214/aoms/1177732144 · DOI · Paper page
- 10.1080/01621459.1965.10480775 · DOI · Paper page
- 10.1198/jasa.2009.tm08651 · DOI · Paper page
- yang, 1999, Information-theoretic determination of minimax rates of convergence, Annals of Statistics, 27, 1564, 10.1214/aos/1017939142 · DOI · Paper page
- assouad, 1997, Festschrift for Lucien Le Cam, 423
- beimel, 2008, Distributed private data analysis: Simultaneously solving how and what, Advances in Cryptology, 451
- 10.1145/1265530.1265569 · DOI · Paper page
- 10.1145/1536414.1536466 · DOI · Paper page
- 10.1109/TIT.2011.2182178 · DOI
- duchi, 2012, Privacy aware learning, Advances in neural information processing systems, 25
- 10.1007/978-3-642-28914-9_18 · DOI
- chaudhuri, 2012, Convergence rates for differentially private statistical estimation, Proceedings of the 29th International Conference on Machine Learning
- 10.1080/01621459.1986.10478229 · DOI
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“While LDP protocols are effective at enforcing privacy and have theoretical justifications [156, 135, 136], a number of results have shown that achieving local differential privacy while preserving utility is challenging particularly, especially in high-dimensional data settings [229, 388, 219, 51, 220, 424, 142, 111].”
BackgroundPractical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
Mironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548
Differential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
Hardy, S., Henecka, W., Ivey-Law, H., Nock, R., Patrini, G., Smith, G., & Thorne, B. (2017) · arXiv · doi:10.48550/arxiv.1711.10677 · Cited by 431
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Distributed Differential Privacy via Shuffling
Cheu, A., Smith, A., Ullman, J., Zeber, D., & Zhilyaev, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17653-2_13 · Cited by 268
Evaluating Differentially Private Machine Learning in Practice
Jayaraman, B., & Evans, D. (2019) · arXiv · doi:10.48550/arxiv.1902.08874 · Cited by 265
Optimal schemes for discrete distribution estimation under locally differential privacy
Ye, M., & Barg, A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2809790 · Cited by 158
Context-Aware Generative Adversarial Privacy
Huang, C., Kairouz, P., Chen, X., Sankar, L., & Rajagopal, R. (2017) · Entropy · doi:10.3390/e19120656 · Cited by 156
The distributed discrete gaussian mechanism for federated learning with secure aggregation
Kairouz, P., Liu, Z., & Steinke, T. (2021) · arXiv · doi:10.48550/arxiv.2102.06387 · Cited by 117
Privacy Amplification by Iteration
Feldman, V., Mironov, I., Talwar, K., & Thakurta, A. (2018) · 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2018.00056 · Cited by 80
A survey on differential privacy for medical data analysis
Liu, W., Zhang, Y., Yang, H., & Meng, Q. (2024) · Annals of Data Science · doi:10.1007/s40745-023-00475-3 · Cited by 66
Inference under information constraints I: Lower bounds from chi-square contraction
Acharya, J., Canonne, C. L., & Tyagi, H. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3028440 · Cited by 59
Practical and private (deep) learning without sampling or shuffling
Kairouz, P., McMahan, B., Song, S., Thakkar, O., Thakurta, A., & Xu, Z. (2021) · arXiv · doi:10.48550/arxiv.2103.00039 · Cited by 52
Lyu, L., He, X., & Li, Y. (2020) · Findings of the Association for Computational Linguistics: EMNLP 2020 · doi:10.18653/v1/2020.findings-emnlp.213 · Cited by 51
Compressive Privacy Generative Adversarial Network
Tseng, B.-W., & Wu, P.-Y. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2968188 · Cited by 48
Wang, Y., Gao, M., Ran, X., Ma, J., & Zhang, L. Y. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119457 · Cited by 42
Lower bounds for learning distributions under communication constraints via Fisher information
Barnes, L. P., Han, Y., & Ozgur, A. (2019) · arXiv · doi:10.48550/arxiv.1902.02890 · Cited by 40
Threats and Defenses in the Federated Learning Life Cycle: A Comprehensive Survey and Challenges
Li, Y., Guo, Z., Yang, N., Chen, H., Yuan, D., & Ding, W. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3563537 · Cited by 38
Protecting Semantic Trajectory Privacy for VANET with Reinforcement Learning
Wang, W., Min, M., Xiao, L., Chen, Y., & Dai, H. (2019) · ICC 2019 - 2019 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2019.8761415 · Cited by 31
Global and Local Differential Privacy for Collaborative Bandits
Wang, H., Zhao, Q., Wu, Q., Chopra, S., Khaitan, A., & Wang, H. (2020) · Fourteenth ACM Conference on Recommender Systems · doi:10.1145/3383313.3412254 · Cited by 28
Secure Federated Submodel Learning
Niu, C., Wu, F., Tang, S., Hua, L., Jia, R., Lv, C., Wu, Z., & Chen, G. (2019) · arXiv · doi:10.48550/arxiv.1911.02254 · Cited by 28
On the Power of Multiple Anonymous Messages
Ghazi, B., Golowich, N., Kumar, R., Pagh, R., & Velingker, A. (2019) · arXiv · doi:10.48550/arxiv.1908.11358 · Cited by 26
Shuffled Model of Federated Learning: Privacy, Communication and Accuracy Trade-offs
Girgis, A. M., Data, D., Diggavi, S., Kairouz, P., & Suresh, A. T. (2020) · arXiv · doi:10.48550/arxiv.2008.07180 · Cited by 16
The power of the hybrid model for mean estimation
Avent, B., Dubey, Y., & Korolova, A. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0062 · Cited by 9
A Privacy-Preserving Querying Mechanism with High Utility for Electric Vehicles
Atmaca, U. I., Biswas, S., Maple, C., & Palamidessi, C. (2024) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2024.3360302 · Cited by 9
Metadata
- Authors
- Duchi, J. C., Jordan, M. I., & Wainwright, M. J.
- Venue
- 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2013-10
- Pages
- 429-438
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2053801139
- Cited by
- 954
- References
- 2
- FWCI
- 17.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
