A General Framework for the Practical Disintegration of PAC-Bayesian Bounds
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VQW4EKFHrecord.jsonopen to challenge →
read the original abstract
PAC-Bayesian bounds are known to be tight and informative when studying the generalization ability of randomized classifiers. However, they require a loose and costly derandomization step when applied to some families of deterministic models such as neural networks. As an alternative to this step, we introduce new PAC-Bayesian generalization bounds that have the originality to provide disintegrated bounds, i.e., they give guarantees over one single hypothesis instead of the usual averaged analysis. Our bounds are easily optimizable and can be used to design learning algorithms. We illustrate this behavior on neural networks, and we show a significant practical improvement over the state-of-the-art framework.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Symmetrization of Loss Functions for Robust Training of Neural Networks in the Presence of Noisy Labels
Symmetrization of multi-class losses produces a unique convex symmetric loss that locally approximates others and supports robust neural training under label noise.
-
Smoothness-Based Derandomization of PAC-Bayes Bounds
Derives smoothness-based PAC-Bayes bounds for deterministic predictors by bounding the Jensen gap class via Rademacher complexity, yielding flatness terms in Jacobians/Hessians, and proposes a corresponding regularize...
-
Smoothness-Based Derandomization of PAC-Bayes Bounds
Derives smoothness-based PAC-Bayes derandomization bounds for deterministic predictors using Rademacher complexity of the Jensen gap class, yielding Jacobian/Hessian flatness terms and a practical regularizer tested o...
-
Symmetrization of Loss Functions for Robust Training of Neural Networks in the Presence of Noisy Labels
Symmetrizing cross-entropy produces the unique convex multi-class unhinged loss, which locally approximates other symmetric losses, and enables new interpolating losses SGCE and alpha-MAE with competitive performance ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.