Integral Probability Metrics PAC-Bayes Bounds
Ron Amit, Baruch Epstein, Shay Moran, Ron Meir
Abstract
We present a PAC-Bayes-style generalization bound which enables the replacement of the KL-divergence with a variety of Integral Probability Metrics (IPM). We provide instances of this bound with the IPM being the total variation metric and the Wasserstein distance. A notable feature of the obtained bounds is that they naturally interpolate between classical uniform convergence bounds in the worst case (when the prior and posterior are far away from each other), and improved bounds in favorable cases (when the posterior and prior are close). This illustrates the possibility of reinforcing classical generalization bounds with algorithm- and data-dependent components, thus making them more suitable to analyze algorithms that use a large hypothesis space.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ec9e87e0-bfc0-4c04-807b-72de8540862dCited by top-tier papers12
- Credal Learning TheoryMichele Caprio, Maryam Sultana, Eleni Elia, Fabio CuzzolinNeurIPS 2024 · 34 citations
- Statistical Indistinguishability of Learning AlgorithmsAlkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris VelegkasICML 2023 · 20 citations
- Learning via Wasserstein-Based High Probability Generalisation BoundsPaul Viallard, Maxime Haddouche, Umut Simsekli, Benjamin GuedjNeurIPS 2023 · 16 citations
- PAC-Bayesian Generalization Bounds for Adversarial Generative ModelsSokhna Diarra Mbacke, Florence Clerc, Pascal GermainICML 2023 · 12 citations
- Time-Independent Information-Theoretic Generalization Bounds for SGLDFutoshi Futami, Masahiro FujisawaNeurIPS 2023 · 12 citations
Builds on6
- Fantastic Generalization Measures and Where to Find ThemYiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan et al.ICLR 2020 · 705 citations
- PAC-Bayes Analysis Beyond the Usual BoundsOmar Rivasplata, Ilja Kuzborskij, Csaba Szepesvári, John Shawe-TaylorNeurIPS 2020 · 101 citations
- Tighter Expected Generalization Error Bounds via Wasserstein DistanceBorja Rodríguez Gálvez, Germán Bassi, Ragnar Thobaben, Mikael SkoglundNeurIPS 2021 · 52 citations
- Measuring Generalization with Optimal TransportChing-Yao Chuang, Youssef Mroueh, Kristjan H. Greenewald, Antonio Torralba et al.NeurIPS 2021 · 33 citations
- A Limitation of the PAC-Bayes FrameworkRoi Livni, Shay MoranNeurIPS 2020 · 26 citations
Related papers
- Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein DistancesRuben Ohana, Kimia Nadjahi, Alain Rakotomamonjy, Liva RalaivolaICML 2023 · 7 citations
- An Exact Characterization of the Generalization Error for the Gibbs AlgorithmGholamali Aminian, Yuheng Bu, Laura Toni, Miguel R. D. Rodrigues et al.NeurIPS 2021 · 75 citations
- Generalization of Hamiltonian algorithmsAndreas MaurerNeurIPS 2024 · 2 citations
- Optimal Bounds between f-Divergences and Integral Probability MetricsRohit Agrawal, Thibaut HorelICML 2020 · 50 citations
- Controlling Multiple Errors Simultaneously with a PAC-Bayes BoundReuben Adams, John Shawe-Taylor, Benjamin GuedjNeurIPS 2024
