Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound
Not on the map. Why?
Abstract (arXiv)
Current PAC-Bayes generalisation bounds are restricted to scalar metrics of performance, such as the loss or error rate. However, one ideally wants more information-rich certificates that control the entire distribution of possible outcomes, such as the distribution of the test loss in regression, or the probabilities of different mis-classifications. We provide the first PAC-Bayes bound capable of providing such rich information by bounding the Kullback-Leibler divergence between the empirical and true probabilities of a set of M error types, which can either be discretized loss values for regression, or the elements of the confusion matrix (or a partition thereof) for classification. We transform our bound into a differentiable training objective. Our bound is especially useful in cases where the severity of different mis-classifications may change over time; existing PAC-Bayes bounds can only bound a particular pre-decided weighting of the error types. In contrast our bound implicitly controls all uncountably many weightings simultaneously.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 15 of its 47 references that are in the map. First posted on arXiv 11 Feb 2022.
Builds on
15 of 47 references.
References · 15
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 281
- 2021User-friendly introduction to PAC-Bayes boundscited by 234
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 125
- 2020Tighter risk certificates for neural networkscited by 112
- 2020On the role of data in PAC-Bayes boundscited by 64
- 2015Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithmcited by 50
- 2019Dichotomize and Generalize: PAC-Bayesian Binary Activated Deep Neural Networkscited by 38
- 2022Non-Vacuous Generalisation Bounds for Shallow Neural Networkscited by 22
- 2018PAC-Bayes bounds for stable algorithms with instance-dependent priorscited by 21
3 more
- 2021Learning PAC-Bayes Priors for Probabilistic Neural Networkscited by 21
- 2021On Margins and Derandomisation in PAC-Bayescited by 19
- 2021Conditionally Gaussian PAC-Bayescited by 7
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.
3 papers.