246 citations · 492 across the 24 of their papers we have counts for
Showing 2021 · stat.MLShow all
2 papers · 2 filters
stat.ML2021
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…
stat.ML2021★ 1 cited
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…