Algorithms with More Granular Differential Privacy Guarantees
summary
Defines per-attribute differential privacy and gives concrete algorithms that trade per-person epsilon for much smaller per-attribute epsilon0. Uses Gaussian projection to answer k‑way marginals with average error scaling like sqrt(k/(ε0 n)) instead of sqrt(d/(ε n)), and a modified multiplicative‑weights/exponential mechanism that samples l≈d/k queries in parallel to control worst‑case error over disjoint sets. For histograms a recursive heavy‑hitters builder yields max error ~log d / ε0 versus the standard d / ε worst case, demonstrating exponential separation.
AI-written summary · about
chapters (9)
- 0:00Intro
- 0:42Background: Differential Privacy (DP)
- 2:14Motivating question: How to interpret ?
- 4:44What do "Nice" DP Algorithms Look Like?
- 10:33Algorithms for k-way Marginals: Average Error
- 13:53Algorithms for k-way Marginals: Max Error
- 16:45Histograms/Heavy Hitters
- 20:54Our Heavy Hitters Algorithm
- 23:30Conclusion
related talks
01h 00mDifferential Privacy And The Complexity Of Simple Queries
01h 00mDifferential Privacy: Fundamentals to Forefront I
01h 02mLarge-Scale Private Learning, Part I
01h 03mStatistical Inference and Privacy, Part II
30mAccuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained...
31mGaussian Differential Privacy (GDP)
01h 14mTutorial: Privacy, Part II
42mDifferential Privacy
