Approximate Differential Privacy of the $\ell_2$ Mechanism
Matthew Joseph, Alex Kulesza, Alexander Yu

TL;DR
This paper analyzes the $ ext{ extl2}$ mechanism for differentially private $d$-dimensional statistics, showing it outperforms Laplace and Gaussian mechanisms in terms of error across various privacy settings.
Contribution
It provides a comparative analysis of the $ ext{ extl2}$ mechanism's error performance against Laplace and Gaussian mechanisms for approximate differential privacy.
Findings
$ ext{ extl2}$ mechanism has lower error than Laplace and Gaussian mechanisms across privacy parameters.
$ ext{ extl2}$ matches Laplace at $d=1$ and approaches Gaussian as $d$ increases.
The error performance varies with dimension and privacy parameters.
Abstract
We study the mechanism for computing a -dimensional statistic with bounded sensitivity under approximate differential privacy. Across a range of privacy parameters, we find that the mechanism obtains lower error than the Laplace and Gaussian mechanisms, matching the former at and approaching the latter as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Privacy, Security, and Data Protection
