2 citations · 3 across the 6 of their papers we have counts for
7 papers
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…
A Framework for Bounding Deterministic Risk with PAC-Bayes: Applications to Majority Votes
Benjamin Leblanc, Pascal Germain
PAC-Bayes is a popular and efficient framework for obtaining generalization guarantees in situations involving uncountable hypothesis spaces. Unfortunately, in its classical formul…
Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks
Benjamin Leblanc, Mathieu Bazinet, Nathaniel D'Amours +2
Both PAC-Bayesian and Sample Compress learning frameworks are instrumental for deriving tight (non-vacuous) generalization bounds for neural networks. We leverage these results in…
Sample Compression Unleashed: New Generalization Bounds for Real Valued Losses
Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain
The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, gener…
On the Relationship Between Interpretability and Explainability in Machine Learning
Benjamin Leblanc, Pascal Germain
Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshoot…