49 search results - page 2 / 10 » On generalization bounds, projection profile, and margin dis... |
COLT
2008
Springer
13 years 7 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
NIPS
2001
13 years 6 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
NIPS
2007
13 years 6 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
JMLR
2012
11 years 7 months ago
2012
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...