2 citations · 3 across the 6 of their papers we have counts for
3 papers · 1 filter
On the disintegration of the stochastic majority vote: From PAC-Bayesian bounds to a self-bounding algorithm
Julien Bastian, Benjamin Leblanc, Pascal Germain +4
Weighted majority votes are central to many successful ensemble methods. PAC-Bayesian theory provides tight generalization guarantees for such models by analyzing the expected risk…
PAC-Bayesian Generalization Guarantees for Fairness on Stochastic and Deterministic Classifiers
Julien Bastian, Benjamin Leblanc, Pascal Germain +5
Classical PAC generalization bounds on the prediction risk of a classifier are insufficient to provide theoretical guarantees on fairness when the goal is to learn models balancing…
Bound to Disagree: Generalization Bounds via Certifiable Surrogates
Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain
Generalization bounds for deep learning models are typically vacuous, not computable or restricted to specific model classes. In this paper, we tackle these issues by providing new…