Personalized Privacy Amplification via Importance Sampling

Dominik Fay, Sebastian Mair, Jens Sjölund
7/5/2023
cs.CRcs.LGstat.ML

Official code: smair/personalized-privacy-amplification-via-importance-sampling (1 star, MIT, last commit 2024-12-23).

Abstract

For scalable machine learning on large data sets, subsampling a representative subset is a common approach for efficient model training. This is often achieved through importance sampling, whereby informative data points are sampled more frequently. In this paper, we examine the privacy properties of importance sampling, focusing on an individualized privacy analysis. We find that, in importance sampling, privacy is well aligned with utility but at odds with sample size. Based on this insight, we propose two approaches for constructing sampling distributions: one that optimizes the privacy-efficiency trade-off; and one based on a utility guarantee in the form of coresets. We evaluate both approaches empirically in terms of privacy, efficiency, and accuracy on the differentially private $k$-means problem. We observe that both approaches yield similar outcomes and consistently outperform uniform sampling across a wide range of data sets. Our code is available on GitHub: https://github.com/smair/personalized-privacy-amplification-via-importance-sampling

View on arXivView PDF

Code Implementations(1)

MIT

Personalized Privacy Amplification via Importance Sampling

10Rust, PythonDec 19, 20241 years agoMIT

Similar Papers

Cite this paper

@article{fay2023personalized,
  title  = {Personalized Privacy Amplification via Importance Sampling},
  author = {Dominik Fay and Sebastian Mair and Jens Sjölund},
  year   = {2023},
  eprint = {2307.10187},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.10187v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.10187.svg)](https://codeofpaper.com/paper/2307.10187)

Discussion