Journal
2019 IEEE INFORMATION THEORY WORKSHOP (ITW)
Volume -, Issue -, Pages 324-328Publisher
IEEE
DOI: 10.1109/itw44776.2019.8989057
Keywords
Maximal Leakage; Generalization Error; Adaptive Data Analysis; Differential Privacy; Max-Information; Mutual Information
Ask authors/readers for more resources
There has been growing interest in studying connections between generalization error of learning algorithms and information measures. In this work, we generalize a result that employs the maximal leakage, a measure of leakage of information, and explore how this bound can be applied in different scenarios. The main application can be found in bounding the generalization error. Rather than analyzing the expected error, we provide a concentration inequality. In this work, we do not require the assumption of sigma-sub gaussianity and show how our results can be used to retrieve a generalization of the classical bounds in adaptive scenarios (e.g., McDiarmid's inequality for c-sensitive functions, false discovery error control via significance level, etc.).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available