3 citations · 8 across the 12 of their papers we have counts for
13 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…
PAC-Bayesian Bounds on Constrained f-Entropic Risk Measures
Hind Atbir, Farah Cherfaoui, Guillaume Metzler +2
PAC generalization bounds on the risk, when expressed in terms of the expected loss, are often insufficient to capture imbalances between subgroups in the data. To overcome this li…
Uniform Generalization Bounds on Data-Dependent Hypothesis Sets via PAC-Bayesian Theory on Random Sets
Benjamin Dupuis, Paul Viallard, George Deligiannidis +1
We propose data-dependent uniform generalization bounds by approaching the problem from a PAC-Bayesian perspective. We first apply the PAC-Bayesian framework on "random sets" in a…
Leveraging PAC-Bayes Theory and Gibbs Distributions for Generalization Bounds with Complexity Measures
Paul Viallard, Rémi Emonet, Amaury Habrard +2
In statistical learning theory, a generalization bound usually involves a complexity measure imposed by the considered theoretical framework. This limits the scope of such bounds,…
Tighter Generalisation Bounds via Interpolation
Paul Viallard, Maxime Haddouche, Umut Şimşekli +1
This paper contains a recipe for deriving new PAC-Bayes generalisation bounds based on the -divergence, and, in addition, presents PAC-Bayes generalisation bounds where we…
A PAC-Bayesian Link Between Generalisation and Flat Minima
Maxime Haddouche, Paul Viallard, Umut Simsekli +1
Modern machine learning usually involves predictors in the overparameterised setting (number of trained parameters greater than dataset size), and their training yields not only go…
From Mutual Information to Expected Dynamics: New Generalization Bounds for Heavy-Tailed SGD
Benjamin Dupuis, Paul Viallard
Understanding the generalization abilities of modern machine learning algorithms has been a major research topic over the past decades. In recent years, the learning dynamics of St…
Learning via Wasserstein-Based High Probability Generalisation Bounds
Paul Viallard, Maxime Haddouche, Umut Şimşekli +1
Minimising upper bounds on the population risk or the generalisation gap has been widely used in structural risk minimisation (SRM) -- this is in particular at the core of PAC-Baye…
Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound
Valentina Zantedeschi, Paul Viallard, Emilie Morvant +4
We investigate a stochastic counterpart of majority votes over finite ensembles of classifiers, and study its generalization properties. While our approach holds for arbitrary dist…
Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound
Paul Viallard, Pascal Germain, Amaury Habrard +1
In the PAC-Bayesian literature, the C-Bound refers to an insightful relation between the risk of a majority vote classifier (under the zero-one loss) and the first two moments of i…
A PAC-Bayes Analysis of Adversarial Robustness
Paul Viallard, Guillaume Vidot, Amaury Habrard +1
We propose the first general PAC-Bayesian generalization bounds for adversarial robustness, that estimate, at test time, how much a model will be invariant to imperceptible perturb…
A General Framework for the Practical Disintegration of PAC-Bayesian Bounds
Paul Viallard, Pascal Germain, Amaury Habrard +1
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 derandomizati…