Sciweavers

Share
968 search results - page 1 / 194
» The Rate of Convergence of AdaBoost
Sort
View
COLT
2010
Springer
8 years 5 months ago
The Convergence Rate of AdaBoost
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-...
Robert E. Schapire
CORR
2011
Springer
193views Education» more  CORR 2011»
7 years 11 months ago
The Rate of Convergence of AdaBoost
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....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...
COLT
2004
Springer
9 years 24 days ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...
NIPS
2003
8 years 8 months ago
On the Dynamics of Boosting
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...
Cynthia Rudin, Ingrid Daubechies, Robert E. Schapi...
CVPR
2006
IEEE
9 years 9 months ago
Probabilistic 3D Polyp Detection in CT Images: The Role of Sample Alignment
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...
Zhuowen Tu, Xiang Sean Zhou, Luca Bogoni, Adrian B...
books