30 citations · 125 across the 26 of their papers we have counts for
4 papers · 1 filter
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…