From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms
This work derives explicit upper bounds on the approximate max-information of any algorithm that fulfills $(\epsilon, \delta)$-differential privacy or R\'enyi differential privacy, thereby going beyond the classical results for pure $\epsilon$-differential privacy.
Christoph H. Lampert, Max Cairney-Leeming, Hossein Zakerinia
· 0 citations