Concentration Bounds for High Sensitivity Functions Through Differential Privacy

Uri Stemmer, Kobbi Nissim

Research output: Contribution to journalArticlepeer-review

Abstract

A new line of work, starting with Dwork et al. (STOC, 2015), demonstrateshow di erential privacy can be used as a mathematical tool for guaranteeing generalizationin adaptive data analysis. Speci cally, if a di erentially private analysis is applied on a sample S of i.i.d. examples to select a low-sensitivity function f, then w.h.p. f(S) is close to its expectation, even though f is being chosen adaptively, i.e., based on the data .Very recently, Steinke and Ullman observed that these generalization guarantees can be used for proving concentration bounds in the non-adaptive setting, where the low-sensitivity function is fixed beforehand. In particular, they obtain alternative proofs for classical concentration bounds for low-sensitivity functions, such as the Cherno bound and McDiarmid's Inequality. In this work, we extend this connection between differential privacy and concentration bounds, and show that differential privacy can be used to prove concentration of functions that are not low-sensitivity.
Original languageEnglish
Pages (from-to)1-33
JournalJournal of Privacy and Confidentiality
Volume9
Issue number1
DOIs
StatePublished - 2019

Fingerprint

Dive into the research topics of 'Concentration Bounds for High Sensitivity Functions Through Differential Privacy'. Together they form a unique fingerprint.

Cite this