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 in . All previous estimators are either nonconstructive, with unbounded running time, or require the user to specify a priori bounds on the parameters and . The primary new technical tool in our algorithm is a new differentially private preconditioner that takes samples from an arbitrary Gaussian and returns a matrix such that has constant condition number.
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}
}