A New Analysis of Differential Privacy's Generalization Guarantees
Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed, Sharifi-Malvajerdi, Moshe Shenfeld

TL;DR
This paper presents a new, elementary proof of the transfer theorem in differential privacy, providing better bounds and insights that improve the practicality of adaptive data analysis.
Contribution
The authors introduce a novel proof technique for the transfer theorem that yields improved bounds and structural insights, enhancing understanding of differential privacy's guarantees.
Findings
New proof of the transfer theorem that is elementary and insightful.
Improved bounds on accuracy that outperform previous methods.
Enhanced practicality of adaptive data analysis with smaller datasets.
Abstract
We give a new proof of the "transfer theorem" underlying adaptive data analysis: that any mechanism for answering adaptively chosen statistical queries that is differentially private and sample-accurate is also accurate out-of-sample. Our new proof is elementary and gives structural insights that we expect will be useful elsewhere. We show: 1) that differential privacy ensures that the expectation of any query on the posterior distribution on datasets induced by the transcript of the interaction is close to its true value on the data distribution, and 2) sample accuracy on its own ensures that any query answer produced by the mechanism is close to its posterior expectation with high probability. This second claim follows from a thought experiment in which we imagine that the dataset is resampled from the posterior distribution after the mechanism has committed to its answers. The…
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.
