English

A Private and Computationally-Efficient Estimator for Unbounded Gaussians

Machine Learning 2022-02-15 v2 Cryptography and Security Data Structures and Algorithms Information Theory Machine Learning math.IT

Abstract

We give the first polynomial-time, polynomial-sample, differentially private estimator for the mean and covariance of an arbitrary Gaussian distribution N(μ,Σ)\mathcal{N}(\mu,\Sigma) in Rd\mathbb{R}^d. All previous estimators are either nonconstructive, with unbounded running time, or require the user to specify a priori bounds on the parameters μ\mu and Σ\Sigma. The primary new technical tool in our algorithm is a new differentially private preconditioner that takes samples from an arbitrary Gaussian N(0,Σ)\mathcal{N}(0,\Sigma) and returns a matrix AA such that AΣATA \Sigma A^T has constant condition number.

Keywords

Cite

@article{arxiv.2111.04609,
  title  = {A Private and Computationally-Efficient Estimator for Unbounded Gaussians},
  author = {Gautam Kamath and Argyris Mouzakis and Vikrant Singhal and Thomas Steinke and Jonathan Ullman},
  journal= {arXiv preprint arXiv:2111.04609},
  year   = {2022}
}
R2 v1 2026-06-24T07:30:52.447Z