PAC-Bayesian theory provides generalization bounds for weighted majority vote. However, these bounds do not directly focus on the risk of the majority vote, but on the risk of the Gibbs classifier. Indeed, it is well-known that the Gibbs classifier and the majority vote are related. To the best of our knowledge the tightest relation is the C-bound proposed by Lacasse et al. (2007); Laviolette et al. (2011) for binary classification. In this paper, we provide three generalizations of the C-bound to multiclass setting
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
We study the generalisation properties of majority voting on finite ensembles of classifiers, provin...
PAC-Bayesian theory provides generalization bounds for weighted majority vote. However, these bounds...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
We propose new PAC-Bayes bounds for the risk of the weighted majority vote that depend on the mean a...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
We study the generalisation properties of majority voting on finite ensembles of classifiers, provin...
PAC-Bayesian theory provides generalization bounds for weighted majority vote. However, these bounds...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
We propose new PAC-Bayes bounds for the risk of the weighted majority vote that depend on the mean a...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThis paper generalizes a pivotal result from the PAC-Bayesian literature —the ...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
International audienceThe C-bound, introduced in Lacasse et al., gives a tight upper bound on the ri...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
International audienceIn the PAC-Bayesian literature, the C-Bound refers to an insightful relation b...
We study the generalisation properties of majority voting on finite ensembles of classifiers, provin...