Online Coordinate Boosting

Statistics – Machine Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 4 figures

Scientific paper

We present a new online boosting algorithm for adapting the weights of a boosted classifier, which yields a closer approximation to Freund and Schapire's AdaBoost algorithm than previous online boosting algorithms. We also contribute a new way of deriving the online algorithm that ties together previous online boosting work. We assume that the weak hypotheses were selected beforehand, and only their weights are updated during online boosting. The update rule is derived by minimizing AdaBoost's loss when viewed in an incremental form. The equations show that optimization is computationally expensive. However, a fast online approximation is possible. We compare approximation error to batch AdaBoost on synthetic datasets and generalization error on face datasets and the MNIST dataset.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Online Coordinate Boosting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Coordinate Boosting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Coordinate Boosting will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-668866

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.