Private Mean Estimation of Heavy-Tailed Distributions

By Gautam Kamath, Vikrant Singhal, Jonathan Ullman. 2020

118 citations recorded by the source corpus.

We give new upper and lower bounds on the minimax sample complexity of differentially private mean estimation of distributions with bounded $k$-th moments. Roughly speaking, in the univariate case, we show that $n = \Theta\left(\frac{1}{\alpha^2} + \frac{1}{\alpha^{\frac{k}{k-1}}\varepsilon}\right)$ samples are necessary and sufficient to estimate the mean to $\alpha$-accuracy under $\varepsilon$-differential privacy, or any of its common relaxations. This result demonstrates a qualitatively different behavior compared to estimation absent privacy constraints, for which the sample complexity is identical for all $k \geq 2$. We also give algorithms for the multivariate setting whose sample complexity is a factor of $O(d)$ larger than the univariate case.

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. Thomas Steinke
  2. Gautam Kamath
  3. Ananda Theertha Suresh
  4. Mark Bun
  5. Zhiwei Steven Wu
  6. Jonathan Ullman
  7. Sanjiv Kumar
  8. Felix X. Yu

In Computational Theory and Mathematics

  1. Mark Bun
  2. Gautam Kamath
  3. Thomas Steinke
  4. Zhiwei Steven Wu
  5. Michael D. Riley
  6. Sanjiv Kumar
  7. Felix X. Yu
  8. Ananda Theertha Suresh

Citations in the corpus