A unified data-processing framework produces tighter change-of-measure inequalities that improve information-theoretic generalization bounds across learning theory and privacy.
Max-information, differential privacy, and post-selection hypothesis testing,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2representative citing papers
Sharper information-theoretic generalization bounds for differentially private algorithms obtained via typicality arguments that improve prior mutual-information results and add new maximal-leakage bounds.
citing papers explorer
-
Tighter Information-Theoretic Generalization Bounds via a Novel Class of Change of Measure Inequalities
A unified data-processing framework produces tighter change-of-measure inequalities that improve information-theoretic generalization bounds across learning theory and privacy.
-
On the Generalization Error of Differentially Private Algorithms via Typicality
Sharper information-theoretic generalization bounds for differentially private algorithms obtained via typicality arguments that improve prior mutual-information results and add new maximal-leakage bounds.