Boosting algorithms for maximizing the soft margin

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Warmuth, Manfred K ^a   Glocer, Karen ^a   Rätsch, Gunnar ^b  

^a University of California Santa Cruz   (United States)

^b FRIEDRICH MIESCHER LABORATORY OF THE MAX PLANCK SOCIETY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; ARTIFICIAL INTELLIGENCE; ENTROPY;

BOOSTING ALGORITHM; CONVEX COMBINATIONS; DUAL OPTIMIZATION PROBLEMS; ITERATION BOUND; LOGARITHMIC GROWTH; NUMBER OF ITERATIONS; PROJECTION METHOD; RELATIVE ENTROPY; SIMULATION STUDIES; SOFT MARGINS;

ITERATIVE METHODS;

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

References (22)

1. L. Breiman. Prediction games and arcing algorithms. Neural Computation, 11(7):1493-1518, 1999. Also Technical Report 504, Statistics Department, University of California Berkeley.
2. Y. Censor and S. A. Zenios. Parallel Optimization. Oxford, New York, 1997.
3. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20(3):273-297, 1995.
4. A. Demiriz, K.P. Bennett, and J. Shawe-Taylor. Linear programming boosting via column generation. Machine Learning, 46(1-3):225-254, 2002. (Pubitemid 34129970)
5. C. Domingo and O. Watanabe. Madaboost: A modification of Adaboost. In Proc. COLT '00, pages 180-189, 2000.
6. Y. Freund. An adaptive version of the boost by majority algorithm. Mach. Learn., 43(3):293-318, 2001. (Pubitemid 32471836)
7. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997. (Pubitemid 127433398)
8. A.J. Grove and D. Schuurmans. Boosting in the limit: Maximizing the margin of learned ensembles. In Proceedings of the Fifteenth National Conference on Artifical Intelligence, 1998.
9. Mark Herbster andManfred K.Warmuth. Tracking the best linear predictor. Journal ofMachine Learning Research, 1:281-309, 2001. (Pubitemid 33687205)
10. R. Hettich and K.O. Kortanek. Semi-infinite programming: Theory, methods and applications. SIAM Review, 3:380-429, September 1993. (Pubitemid 23712350)
11. J. Kivinen and M. K. Warmuth. Boosting as entropy projection. In Proc. 12th Annu. Conference on Comput. Learning Theory, pages 134-144. ACM Press, New York, NY, 1999. (Pubitemid 32213950)
12. J. Liao. Totally Corrective Boosting Algorithms that Maximize the Margin. PhD thesis, University of California at Santa Cruz, December 2006.
13. R. Meir and G. Rätsch. An introduction to boosting and leveraging. In S. Mendelson and A. Smola, editors, Proc. 1st Machine Learning Summer School, Canberra, LNCS, pages 119-184. Springer, 2003.
14. G. Rätsch. Robust Boosting via Convex Optimization: Theory and Applications. PhD thesis, University of Potsdam, Germany, December 2001.
15. G. Rätsch, T. Onoda, and K.-R. Müller. Soft margins for AdaBoost. Machine Learning, 42(3):287-320, 2001. (Pubitemid 32188795)
16. G. Rätsch, B. Schölkopf, A.J. Smola, S. Mika, T. Onoda, and K.-R. Müller. Robust ensemble learning. In A.J. Smola, P.L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 207-219. MIT Press, Cambridge, MA, 2000.
17. G. Rätsch and M. K.Warmuth. Efficient margin maximizing with boosting. Journal of Machine Learning Research, 6:2131-2152, December 2005. (Pubitemid 41798123)
18. C. Rudin, I. Daubechies, and R.E. Schapire. The dynamics of adaboost: Cyclic behavior and convergence of margins. Journal of Machine Learning Research, 5:1557-1595, 2004.
19. R.E. Schapire, Y. Freund, P.L. Bartlett, and W.S. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26(5):1651-1686, 1998. (Pubitemid 128376902)
20. B. Schölkopf, A.J. Smola, R.C. Williamson, and P.L. Bartlett. New support vector algorithms. Neural Comput., 12(5):1207-1245, 2000.
21. Rocco A. Servedio. Smooth boosting and learning with malicious noise. Journal of Machine Learning Research, 4:633-648, 2003.
22. M.K. Warmuth, J. Liao, and G. Rätsch. Totally corrective boosting algorithms that maximize the margin. In Proc. ICML '06, pages 1001-1008. ACM Press, 2006.