Sciweavers

120 search results - page 1 / 24
» Boosting as Entropy Projection
Sort
View
COLT
1999
Springer
13 years 9 months ago
Boosting as Entropy Projection
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
Jyrki Kivinen, Manfred K. Warmuth
NIPS
2007
13 years 6 months ago
Boosting Algorithms for Maximizing the Soft Margin
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....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
PRL
2007
138views more  PRL 2007»
13 years 4 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
ICPR
2006
IEEE
14 years 6 months ago
Ent-Boost: Boosting Using Entropy Measure for Robust Object Detection
Recently, boosting is used widely in object detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifiers which is on...
Duy-Dinh Le, Shin'ichi Satoh
ICML
2006
IEEE
14 years 5 months ago
Totally corrective boosting algorithms that maximize the margin
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...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth