Misclassification excess risk bounds for PAC-Bayesian classification via convexified loss
Not on the map. Why?
Abstract (arXiv)
PAC-Bayesian bounds have proven to be a valuable tool for deriving generalization bounds and for designing new learning algorithms in machine learning. However, it typically focus on providing generalization bounds with respect to a chosen loss function. In classification tasks, due to the non-convex nature of the 0-1 loss, a convex surrogate loss is often used, and thus current PAC-Bayesian bounds are primarily specified for this convex surrogate. This work shifts its focus to providing misclassification excess risk bounds for PAC-Bayesian classification when using a convex surrogate loss. Our key ingredient here is to leverage PAC-Bayesian relative bounds in expectation rather than relying on PAC-Bayesian bounds in probability. We demonstrate our approach in several important applications.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 33 references that are in the map. First posted on arXiv 16 Aug 2024.
Builds on
11 of 33 references.
References · 11
- 2021User-friendly introduction to PAC-Bayes boundscited by 239
- 2019A Primer on PAC-Bayesian Learningcited by 132
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2017Concentration of tempered posteriors and of their variational approximationscited by 66
- 2018Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization Boundscited by 24
- 2017High-dimensional classification by sparse logistic regressioncited by 19
- 20161-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximationcited by 11
- 2023A reduced-rank approach to predicting multiple binary responses through machine learningcited by 10
- 2023High-dimensional sparse classification using exponential weighting with empirical hinge losscited by 10
- 2018Collective Matrix Completioncited by 9
- 2024Misclassification bounds for PAC-Bayesian sparse deep learningcited by 7
Built on by
Not cited yet.