Locally Private Mean Estimation: Z-test and Tight Confidence Intervals

By Marco Gaboardi, Ryan M. Rogers, Or Sheffet. 2018

50 citations recorded by the source corpus.

This work provides tight upper- and lower-bounds for the problem of mean estimation under differential privacy in the local-model, when the input is composed of n i.i.d. drawn samples from a Gaussian. Our algorithms result in a (1-\beta)-confidence interval for the underlying distribution's mean of length O( sigma *sqrt(log(n/beta)log(1/\beta))/(\epsilon*sqrt(n) ). In addition, our algorithms leverage on binary search using local differential privacy for quantile estimation, a result which may be of separate interest. Moreover, our algorithms have a matching lower-bound, where we prove that any one-shot (each individual is presented with a single query) local differentially private algorithm must return an interval of length Omega( sigma*sqrt(\log(1/\beta))/(\epsilon*sqrt(n)) ).

How researchers see this paper

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

  1. Badih Ghazi
  2. Jayadev Acharya
  3. Ravi Kumar
  4. Vitaly Feldman
  5. Peter Kairouz
  6. Matthew Joseph
  7. Yatharth Dubey
  8. Aleksandra Korolova

Citations in the corpus