Change of measure through the Legendre transform
Not on the map. Why?
Abstract (arXiv)
PAC-Bayes generalisation bounds are derived via change-of-measure inequalities that transfer concentration properties from a reference measure to all posterior measures. The specific choice of change of measure determines the assumptions required on the empirical risk; in particular, the classical Donsker--Varadhan theorem leads to bounds relying on bounded exponential moments. We study change-of-measure inequalities based on (f)-divergences, obtained by combining the Legendre transform of (f) with the Fenchel--Young inequality. Beyond their intrinsic interest in probability theory, we show how these inequalities are helpful in learning theory and yield PAC-Bayes bounds under tailored assumptions on the empirical risk, thereby extending the range of conditions under which PAC-Bayesian guarantees can be established.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 4 of its 24 references that are in the map. First posted on arXiv 11 Feb 2022.
Builds on
4 of 24 references.
References · 4
- 2021User-friendly introduction to PAC-Bayes boundscited by 234
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2016Simpler PAC-Bayesian Bounds for Hostile Datacited by 45
- 2020PAC-Bayes unleashed: generalisation bounds with unbounded lossescited by 43
Built on by
Citing papers per year: 2022: 5; 2023: 3; 2024: 1; 2025: 1.
10 papers.
- 2023Dual RL: Unification and New Methods for Reinforcement and Imitation Learningcited by 48
- 2022PAC-Bayes Generalisation Bounds for Heavy-Tailed Losses through Supermartingalescited by 23
- 2022Integral Probability Metrics PAC-Bayes Boundscited by 19
- 2022Instance-Dependent Generalization Bounds via Optimal Transportcited by 13
- 2023Learning via Wasserstein-Based High Probability Generalisation Boundscited by 11
- 2022Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficultycited by 9
- 2022Sum-of-Squares Relaxations for Information Theory and Variational Inferencecited by 6
- 2023Wasserstein PAC-Bayes Learning: Exploiting Optimisation Guarantees to Explain Generalisationcited by 3
- 2024Tighter Generalisation Bounds via Interpolationcited by 2
- 2025Non-Vacuous Generalization Bounds: Can Rescaling Invariances Help?cited by 1
- 2025Non-Vacuous Generalization Bounds: Can Rescaling Invariances Help?30 Sep 2025
- 2024Tighter Generalisation Bounds via Interpolation7 Feb 2024
- 2023Learning via Wasserstein-Based High Probability Generalisation Bounds7 Jun 2023
- 2023Wasserstein PAC-Bayes Learning: Exploiting Optimisation Guarantees to Explain Generalisation14 Apr 2023
- 2023Dual RL: Unification and New Methods for Reinforcement and Imitation Learning16 Feb 2023
- 2022Instance-Dependent Generalization Bounds via Optimal Transport2 Nov 2022
- 2022Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty20 Oct 2022
- 2022PAC-Bayes Generalisation Bounds for Heavy-Tailed Losses through Supermartingales3 Oct 2022
- 2022Integral Probability Metrics PAC-Bayes Bounds1 Jul 2022
- 2022Sum-of-Squares Relaxations for Information Theory and Variational Inference27 Jun 2022