Geometrizing rates of convergence under local differential privacy constraints

35Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

We study the problem of estimating a functional θ(P) of an unknown probability distribution P ∈ P in which the original iid sample X1,..., Xn is kept private even from the statistician via an α-local differential privacy constraint. Let ωTV denote the modulus of continuity of the functional θ over P with respect to total variation distance. For a large class of loss functions l and a fixed privacy level α, we prove that the privatized minimax risk is equivalent to l(ωTV(n−1/2)) to within constants, under regularity conditions that are satisfied, in particular, if θ is linear and P is convex. Our results complement the theory developed by Donoho and Liu (1991) with the nowadays highly relevant case of privatized data. Somewhat surprisingly, the difficulty of the estimation problem in the private case is characterized by ωTV, whereas, it is characterized by the Hellinger modulus of continuity if the original data X1,..., Xn are available. We also find that for locally private estimation of linear functionals over a convex model a simple sample mean estimator, based on independently and binary privatized observations, always achieves the minimax rate. We further provide a general recipe for choosing the functional parameter in the optimal binary privatization mechanisms and illustrate the general theory in numerous examples. Our theory allows us to quantify the price to be paid for local differential privacy in a large class of estimation problems. This price appears to be highly problem specific.

Cite

CITATION STYLE

APA

Rohde, A., & Steinberger, L. (2020). Geometrizing rates of convergence under local differential privacy constraints. Annals of Statistics, 48(5), 2646–2670. https://doi.org/10.1214/19-AOS1901

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free