content type paperpublished May 2019
Lower Bounds for Locally Private Estimation via Communication Complexity
In collaboration with Stanford University
AuthorsJohn Duchi, Ryan Rogers
We develop lower bounds for estimation under local privacy constraints—including differential privacy and its relaxations to approximate or Rényi differential privacy—by showing an equivalence between private estimation and communication-restricted estimation problems. Our results apply to arbitrarily interactive privacy mechanisms, and they also give sharp lower bounds for all levels of differential privacy protections, that is, privacy mechanisms with privacy levels
Related readings and updates.
Apple Privacy-Preserving Machine Learning Workshop 2022
Earlier this year, Apple hosted the Workshop on Privacy-Preserving Machine Learning (PPML). This virtual event brought Apple and members of the academic research communities together to discuss the state of the art in the field of privacy-preserving machine learning through a series of talks and discussions over two days.
A Survey on Privacy from Statistical, Information and Estimation-Theoretic Views
The privacy risk has become an emerging challenge in both information theory and computer science due to the massive (centralized) collection of user data. In this paper, we overview privacy-preserving mechanisms and metrics from the lenses of information theory, and unify different privacy metrics, including f-divergences, Renyi divergences, and differential privacy, by the probability likelihood ratio (and the logarithm of it). We introduce…
See paper details
Discover opportunities in Machine Learning.
Our research in machine learning breaks new ground every day.