Bandit-Aided Boosting

Abstract : In this paper we apply multi-armed bandits (MABs) to accelerate ADABOOST. ADABOOST constructs a strong classifier in a stepwise fashion by selecting simple base classifiers and using their weighted "vote" to determine the final classification. We model this stepwise base classifier selection as a sequential decision problem, and optimize it with MABs. Each arm represent a subset of the base classifier set. The MAB gradually learns the "utility" of the subsets, and selects one of the subsets in each iteration. ADABOOST then searches only this subset instead of optimizing the base classifier over the whole space. The reward is defined as a function of the accuracy of the base classifier. We investigate how the MAB algorithms (UCB, UCT) can be applied in the case of boosted stumps, trees, and products of base classifiers. On benchmark datasets, our bandit-based approach achieves only slightly worse test errors than the standard boosted learners for a computational cost that is an order of magnitude smaller than with standard ADABOOST.
docType_s : Poster communications
Domain :
Contributor : Marechal Françoise <>
Submitted on : \, March 28, 2011 - 4:00:01 PM
Last modification on : \, March 28, 2011 - 4:00:01 PM




  • HAL Id : in2p3-00580588, version 1


R. Busa-Fekete, B. Kégl. Bandit-Aided Boosting. OPT 2009: 2nd NIPS Workshop on Optimization for Machine Learning, Dec 2009, Whistler, Canada. <in2p3-00580588>