The Convergence Rate of AdaBoost

15 years 26 days ago

Download www.cs.princeton.edu

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-error hypotheses to generate a single "strong"

Robert E. Schapire

Real-time Traffic

AdaBoost | COLT 2010 | Convergence | Exponential Loss | Machine Learning |

claim paper

Related Content

» The Rate of Convergence of AdaBoost

» Boosting Based on a Smooth Margin

» On the Dynamics of Boosting

» Probabilistic 3D Polyp Detection in CT Images The Role of Sample Alignment

» Learning rofk Functions by Boosting

» Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade

» Gabor Feature Selection for Face Recognition Using Improved AdaBoost Learning

» AdaBoostBased Algorithm for Network Intrusion Detection

» AdaBoostMRF Boosted Markov Random Forests and Application to Multilevel Activity Recogniti...

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	COLT
Authors	Robert E. Schapire

Comments (0)

Sciweavers

The Convergence Rate of AdaBoost

AdaBoost | COLT 2010 | Convergence | Exponential Loss | Machine Learning |

Explore & Download

Productivity Tools

Sciweavers