Mean Estimation Under Heterogeneous Privacy Demands
Abstract
Differential Privacy (DP) is a well-established framework to quantify privacy loss incurred by any algorithm. Traditional formulations impose a uniform privacy requirement for all users, which is often inconsistent with real-world scenarios in which users dictate their privacy preferences individually. This work considers the problem of mean estimation, where each user can impose their own distinct privacy level. The algorithm we propose is shown to be minimax optimal and has a near-linear run-time. Our results elicit an interesting saturation phenomenon that occurs. Namely, the privacy requirements of the most stringent users dictate the overall error rates. As a consequence, users with less but differing privacy requirements are all given more privacy than they require, in equal amounts. In other words, these privacy-indifferent users are given a nontrivial degree of privacy for free, without any sacrifice in the performance of the estimator.
Cite
@article{arxiv.2310.13137,
title = {Mean Estimation Under Heterogeneous Privacy Demands},
author = {Syomantak Chaudhuri and Konstantin Miagkov and Thomas A. Courtade},
journal= {arXiv preprint arXiv:2310.13137},
year = {2023}
}
Comments
A preliminary conference version was published at ISIT 2023 and uploaded to arxiv (arXiv:2305.09668). This version significantly expands on the previous article and is being submitted to a journal