Privately Learning High-Dimensional Distributions

By Gautam Kamath, Jerry Zheng Li, Vikrant Singhal, Jonathan Ullman. 2018

176 citations recorded by the source corpus.

We present novel, computationally efficient, and differentially private algorithms for two fundamental high-dimensional learning problems: learning a multivariate Gaussian and learning a product distribution over the Boolean hypercube in total variation distance. The sample complexity of our algorithms nearly matches the sample complexity of the optimal non-private learners for these tasks in a wide range of parameters, showing that privacy comes essentially for free for these problems. In particular, in contrast to previous approaches, our algorithm for learning Gaussians does not require strong a priori bounds on the range of the parameters. Our algorithms introduce a novel technical approach to reducing the sensitivity of the estimation procedure that we call recursive private preconditioning.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jonathan Ullman
  2. Florian Tramèr
  3. Thomas Steinke
  4. Nicholas Carlini
  5. Abhradeep Thakurta
  6. Ziteng Sun
  7. Jayadev Acharya
  8. Gautam Kamath

In Computational Theory and Mathematics

  1. Mark Bun
  2. Thomas Steinke
  3. Jonathan Ullman
  4. Gautam Kamath
  5. Zhiwei Steven Wu
  6. Ziteng Sun
  7. Jayadev Acharya
  8. Huanyu Zhang

Citations in the corpus