~/talk

Algorithms with More Granular Differential Privacy Guarantees

Talkat ITCS 2023 · 2023-01-10..01-13· [privacy-and-compliance, data-visualization]
links:none on file
links:none on file
links:none on file
links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:42Background: Differential Privacy (DP)
  3. 2:14Motivating question: How to interpret ?
  4. 4:44What do "Nice" DP Algorithms Look Like?
  5. 10:33Algorithms for k-way Marginals: Average Error
  6. 13:53Algorithms for k-way Marginals: Max Error
  7. 16:45Histograms/Heavy Hitters
  8. 20:54Our Heavy Hitters Algorithm
  9. 23:30Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.