38 search results - page 1 / 8 » Totally corrective boosting algorithms that maximize the mar... |
ICML
2006
IEEE
14 years 5 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...
AAAI
1998
13 years 6 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
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....
FGR
2004
IEEE
13 years 8 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...