The Right Complexity Measure in Locally Private Estimation: It is not the Fisher Information

06/14/2018
by   John C. Duchi, et al.
0

We identify fundamental tradeoffs between statistical utility and privacy under local models of privacy in which data is kept private even from the statistician, providing instance-specific bounds for private estimation and learning problems by developing the local minimax risk. In contrast to approaches based on worst-case (minimax) error, which are conservative, this allows us to evaluate the difficulty of individual problem instances and delineate the possibilities for adaptation in private estimation and inference. Our main results show that the local modulus of continuity of the estimand with respect to the variation distance---as opposed to the Hellinger distance central to classical statistics---characterizes rates of convergence under locally private estimation for many notions of privacy, including differential privacy and its relaxations. As consequences of these results, we identify an alternative to the Fisher information for private estimation, giving a more nuanced understanding of the challenges of adaptivity and optimality, and provide new minimax bounds for high-dimensional estimation showing that even interactive locally private procedures suffer poor performance under weak notions of privacy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2019

Lower Bounds for Locally Private Estimation via Communication Complexity

We develop lower bounds for estimation under local privacy constraints--...
research
05/03/2018

Geometrizing rates of convergence under differential privacy constraints

We study estimation of a functional θ( P) of an unknown probability dist...
research
03/10/2020

Interactive versus non-interactive locally, differentially private estimation: Two elbows for the quadratic functional

Local differential privacy has recently received increasing attention fr...
research
10/16/2018

Optimal locally private estimation under ℓ_p loss for 1< p< 2

We consider the minimax estimation problem of a discrete distribution wi...
research
05/24/2016

Local Minimax Complexity of Stochastic Convex Optimization

We extend the traditional worst-case, minimax analysis of stochastic con...
research
10/05/2022

On the Statistical Complexity of Estimation and Testing under Privacy Constraints

Producing statistics that respect the privacy of the samples while still...
research
11/13/2017

Heavy Hitters and the Structure of Local Privacy

We present a new locally differentially private algorithm for the heavy ...

Please sign up or login with your details

Forgot password? Click here to reset