PAC-Bayes Mini-tutorial: A Continuous Union Bound
Not on the map. Why?
Abstract (arXiv)
When I first encountered PAC-Bayesian concentration inequalities they seemed to me to be rather disconnected from good old-fashioned results like Hoeffding's and Bernstein's inequalities. But, at least for one flavour of the PAC-Bayesian bounds, there is actually a very close relation, and the main innovation is a continuous version of the union bound, along with some ingenious applications. Here's the gist of what's going on, presented from a machine learning perspective.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 May 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2.
4 papers.
- 2021User-friendly introduction to PAC-Bayes boundscited by 234
- 2021Information Complexity and Generalization Boundscited by 14
- 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measurescited by 11
- 2022PAC-Bayes Bounds for Bandit Problems: A Survey and Experimental Comparisoncited by 7
- 2022PAC-Bayes Bounds for Bandit Problems: A Survey and Experimental Comparison29 Nov 2022
- 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measures24 Feb 2022
- 2021User-friendly introduction to PAC-Bayes bounds21 Oct 2021
- 2021Information Complexity and Generalization Bounds4 May 2021