928 search results - page 1 / 186 » The Rate of Convergence of AdaBoost |
COLT
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We pose the problem of determining the rate of convergence at which AdaBoost minimizes exponential loss. Boosting is the problem of combining many "weak," high-...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
COLT
2004
Springer
13 years 9 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...
NIPS
2003
13 years 5 months ago
2003
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
Automatic polyp detection is an increasingly important task in medical imaging with virtual colonoscopy [15] being widely used. In this paper, we present a 3D object detection alg...