We prove the first margin-based generalization bound for voting classifiers, that is asymptotically tight in the tradeoff between the size of the hypothesis set, the margin, the fraction of training points with the given margin, the number of training samples and the failure probability.
Related papers
Ranked by semantic similarity β how closely each paper's abstract matches this one (100% = near-identical topic).