Totally Corrective Multiclass Boosting with Binary Weak Learners

Details Totally Corrective Multiclass Boosting with Binary Weak Learners Totally Corrective Multiclass Boosting with Binary Weak Learners

2010-09-20

arxiv.org/abs/1009.3702v1

Computer Science

Learning

11 pages

Scientific paper

In this work, we propose a new optimization framework for multiclass boosting learning. In the literature, AdaBoost.MO and AdaBoost.ECC are the two successful multiclass boosting algorithms, which can use binary weak learners. We explicitly derive these two algorithms' Lagrange dual problems based on their regularized loss functions. We show that the Lagrange dual formulations enable us to design totally-corrective multiclass algorithms by using the primal-dual optimization technique. Experiments on benchmark data sets suggest that our multiclass boosting can achieve a comparable generalization capability with state-of-the-art, but the convergence speed is much faster than stage-wise gradient descent boosting. In other words, the new totally corrective algorithms can maximize the margin more aggressively.

Affiliated with

Also associated with

No associations

Rating

Totally Corrective Multiclass Boosting with Binary Weak Learners 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 Totally Corrective Multiclass Boosting with Binary Weak Learners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Totally Corrective Multiclass Boosting with Binary Weak Learners will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263627