Instance-optimal Mean Estimation Under Differential Privacy

06/01/2021
by   Ziyue Huang, et al.
0

Mean estimation under differential privacy is a fundamental problem, but worst-case optimal mechanisms do not offer meaningful utility guarantees in practice when the global sensitivity is very large. Instead, various heuristics have been proposed to reduce the error on real-world data that do not resemble the worst-case instance. This paper takes a principled approach, yielding a mechanism that is instance-optimal in a strong sense. In addition to its theoretical optimality, the mechanism is also simple and practical, and adapts to a variety of data characteristics without the need of parameter tuning. It easily extends to the local and shuffle model as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/16/2020

Near Instance-Optimality in Differential Privacy

We develop two notions of instance optimality in differential privacy, i...
06/06/2019

Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation

The simplest and most widely applied method for guaranteeing differentia...
05/27/2019

Locally Differentially Private Minimum Finding

We investigate a problem of finding the minimum, in which each user has ...
11/24/2019

Four accuracy bounds and one estimator for frequency estimation under local differential privacy

We present four lower bounds on the mean squared error of both frequency...
11/06/2020

The Bayes Security Measure

Security system designers favor worst-case security measures, such as th...
01/15/2021

Preprocessing Imprecise Points for the Pareto Front

In the preprocessing model for uncertain data we are given a set of regi...
05/05/2022

Optimal Algorithms for Mean Estimation under Local Differential Privacy

We study the problem of mean estimation of ℓ_2-bounded vectors under the...