English

Designing Differentially Private Estimators in High Dimensions

Machine Learning 2020-07-23 v3 Cryptography and Security Data Structures and Algorithms Machine Learning

Abstract

We study differentially private mean estimation in a high-dimensional setting. Existing differential privacy techniques applied to large dimensions lead to computationally intractable problems or estimators with excessive privacy loss. Recent work in high-dimensional robust statistics has identified computationally tractable mean estimation algorithms with asymptotic dimension-independent error guarantees. We incorporate these results to develop a strict bound on the global sensitivity of the robust mean estimator. This yields a computationally tractable algorithm for differentially private mean estimation in high dimensions with dimension-independent privacy loss. Finally, we show on synthetic data that our algorithm significantly outperforms classic differential privacy methods, overcoming barriers to high-dimensional differential privacy.

Keywords

Cite

@article{arxiv.2006.01944,
  title  = {Designing Differentially Private Estimators in High Dimensions},
  author = {Aditya Dhar and Jason Huang},
  journal= {arXiv preprint arXiv:2006.01944},
  year   = {2020}
}

Comments

9 pages, 3 figures, presented at the ICML 2020 Workshop on Economics of Privacy and Data Labor

R2 v1 2026-06-23T16:00:38.030Z