Privately Answering Counting Queries with Generalized Gaussian Mechanisms
Arun Ganesh, Jiazheng Zhao

TL;DR
This paper introduces a new differentially private mechanism using Generalized Gaussian noise to answer counting queries with improved error bounds, narrowing the gap between upper and lower bounds for privacy-preserving data analysis.
Contribution
The paper presents a novel mechanism based on Generalized Gaussian distributions that improves the error bounds for answering counting queries under differential privacy.
Findings
Achieves $ ilde{O}(rac{ oot ext{log} ext{log} ext{log}k}{epsilon})$ error bound.
Reduces the gap between known upper and lower bounds for $ ext{l}_ ext{infinity}$-error.
Introduces a mechanism that balances $ ext{l}_1$ and $ ext{l}_ ext{infinity}$ errors, potentially of independent interest.
Abstract
We consider the problem of answering counting (i.e. sensitivity-1) queries about a database with -differential privacy. We give a mechanism such that if the true answers to the queries are the vector , the mechanism outputs answers with the -error guarantee: This reduces the multiplicative gap between the best known upper and lower bounds on -error from to . Our main technical contribution is an analysis of the family of mechanisms of the following form for answering counting queries: Sample from a \textit{Generalized Gaussian}, i.e. with probability proportional to , and output . This family…
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.
