Formal limitations of sample-wise information-theoretic generalization bounds
Machine Learning
2022-12-14 v2 Machine Learning
Abstract
Some of the tightest information-theoretic generalization bounds depend on the average information between the learned hypothesis and a single training example. However, these sample-wise bounds were derived only for expected generalization gap. We show that even for expected squared generalization gap no such sample-wise information-theoretic bounds exist. The same is true for PAC-Bayes and single-draw bounds. Remarkably, PAC-Bayes, single-draw and expected squared generalization gap bounds that depend on information in pairs of examples exist.
Keywords
Cite
@article{arxiv.2205.06915,
title = {Formal limitations of sample-wise information-theoretic generalization bounds},
author = {Hrayr Harutyunyan and Greg Ver Steeg and Aram Galstyan},
journal= {arXiv preprint arXiv:2205.06915},
year = {2022}
}
Comments
2022 IEEE Information Theory Workshop