University of Cambridge > Talks.cam > Statistics > Geometrizing rates of convergence under local differential privacy

Geometrizing rates of convergence under local differential privacy

Add to your list(s) Download to your calendar using vCal

  • UserLukas Steinberger, University of Freiburg
  • ClockFriday 07 June 2019, 16:00-17:00
  • HouseMR12.

If you have a question about this talk, please contact Dr Sergio Bacallado.

One of the many new challenges for data analysis in the information age is the increasing concern of privacy protection. A particularly fruitful approach to data protection that has recently received a lot of attention, is the notion of `local differential privacy’. The idea is that each data providing individual releases only a randomly perturbed version of its original data, where the randomization mechanism is required to satisfy a precise privacy definition.

In this talk, we discuss the impact of a local differential privacy guarantee on the quality of statistical estimation. In this setup, the objective is not only to come up with an optimal estimation procedure that efficiently recovers information from the privatized observations, but also to devise a privatization mechanism that best facilitates subsequent estimation while respecting the required privacy provisions. In the general context of estimating linear functionals of the unknown true data generating distribution, we characterize the minimax rate of private estimation in terms of a certain modulus of continuity of the functional to be estimated and provide a construction of minimax rate optimal privatization mechanisms. Somewhat surprisingly, it can be shown that simple sample means of appropriately randomized observations are always optimal for estimating linear functionals. Our analysis also allows for a quantification of the price of local differential privacy in terms of loss of statistical accuracy. This price appears to be highly problem dependent.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity