Fast boosting using adversarial bandits

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 143-150

  Busa Fekete, Róbert ^a,b   Kégl, Balázs ^a  

^a UNIVERSITÉ PARIS SUD   (France)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ADABOOST; BASE CLASSIFIERS; BENCHMARK DATASETS; BOOSTING ALGORITHM; COMPUTATIONAL COSTS; DECISION PROBLEMS; GENERALIZATION PERFORMANCE; MULTI ARMED BANDIT; ORDER OF MAGNITUDE;

CLASSIFIERS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; OPTIMIZATION; SET THEORY;

ADAPTIVE BOOSTING;

EID: 77956554273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Audibert, J.-Y., Munos, R., and Szepesvári, Cs. Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theor. Comput. Sci., 410(19):1876-1902, 2009.
2. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R.E. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of the 36th Ann. Symp. on Foundations of Computer Science, pp. 322-331, 1995.
3. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002a.
4. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R.E. The non-stochastic multi-armed bandit problem. SIAM J. on Computing, 32(1):48-77, 2002b.
5. Bottou, L. and Bousquet, O. The tradeoffs of large scale learning. In NIPS, volume 20, pp. 161-168, 2008.
6. Bradley, J.K. and Schapire, R.E. FilterBoost: Regression and classification on large datasets. In NIPS, volume 20, 2008.
7. Busa-Fekete, R. and Kégl, B. Accelerating AdaBoost using UCB. In KDDCup 2009 (JMLR W&CP), volume 7, pp. 111-122, 2009.
8. Cesa-Bianchi, N. and Lugosi, G. Prediction, Learning, and Games. Cambridge University Press, 2006.
9. Coquelin, P-A. and Munos, R. Bandit algorithms for tree search. In UAI, volume 23, 2007.
10. De Mesmay, F., Rimmel, A., Voronenko, Y., and Püschel, M. Bandit-based optimization on graphs with application to library performance tuning. In ICML, volume 26, pp. 729-736, 2009.
11. Escudero, G., Màrquez, L., and Rigau, G. Boosting applied to word sense disambiguation. In ECML, volume 11, pp. 129-141, 2000.
12. Freund, Y. and Schapire, R. E. A decision-theoretic generalization of on-line learning and an application to boosting. J. of Comp. and Sys. Sci., 55:119-139, 1997.
13. Kégl, B. and Busa-Fekete, R. Boosting products of base classifiers. In ICML, volume 26, pp. 497-504, 2009.
14. Kocsis, L. and Szepesvári, Cs. Reduced-Variance Payoff Estimation in Adversarial Bandit Problems. In ECML Work, on Reinforcement Learning in Non-Stationary Environments, 2005.
15. Maturana, J., Fialho, Á., Saubion, F., Schoenauer, M., and Sebag, M. Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In IEEE ICEC, pp. 365-372, 2009.
16. Mease, D. and Wyner, A. Evidence contrary to the statistical view of boosting. JMLR, 9:131-156, 2007.
17. Quinlan, J. C4-5: Programs for Machine Learning. Morgan Kaufmann, 1993.
18. Schapire, R. E. and Singer, Y. Improved boosting algorithms using confidence-rated predictions. Mach. Learn., 37(3):297-336, 1999.
19. Viola, P. and Jones, M. Robust real-time face detection. Int. J. of Comp. Vis., 57:137-154, 2004.