Maximizing the margin with boosting

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2375, Issue , 2002, Pages 334-350

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

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; GEOMETRY; ITERATIVE METHODS;

EXPONENTIAL CONVERGENCE; GENERALIZATION ERROR; LINEAR COMBINATIONS; MAXIMUM MARGIN; MODIFIED ALGORITHMS; NUMBER OF ITERATIONS; SEPARATING HYPERPLANE; TRAINING ERRORS;

COMPUTATION THEORY;

EID: 84937423775     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_23     Document Type: Conference Paper

References (24)

1. K.P. Bennett, A. Demiriz, and J. Shawe-Taylor. A column generation algorithm for boosting. In P. Langley, editor, Proceedings, 17th ICML, pages 65-72, San Francisco, 2000.
2. L. Breiman. Prediction games and arcing algorithms. Neural Computation, 11(7):1493-1518, 1999. Also Technical Report 504, Statistics Dept., University of California Berkeley.
3. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, September 1995.
4. Y. Freund and R.E. Schapire. Experiments with a new boosting algorithm. In Proc. 13th International Conference on Machine Learning, pages 148-146. Morgan Kaufmann, 1996.
5. 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.
6. Y. Freund and R.E. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79-103, 1999.
7. A.J. Grove and D. Schuurmans. Boosting in the limit: Maximizing the margin of learned ensembles. In Proc. of the Fifteenth National Conference on Artifical Intelligence, 1998.
8. R. Hettich and K.O. Kortanek. Semi-infinite programming: Theory, methods and applications. SIAM Review, 3:380-429, September 1993.
9. J. Kivinen and M. Warmuth. Boosting as entropy projection. In Proc. 12th Annu. Conference on Comput. Learning Theory, pages 134-144. ACM Press, New York, NY, 1999.
10. V. Koltchinskii, D. Panchenko, and F. Lozano. Some new bounds on the generalization error of combined classifiers. In Advances in Neural Inf. Proc. Systems, volume 13, 2001.
11. O.L. Mangasarian. Arbitrary-norm separating plane. Op. Res. Letters, 24(1):15-23, 1999.
12. S. Nash and A. Sofer. Linear and Nonlinear Programming. McGraw-Hill, New York, 1996.
13. J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1992.
14. J.R. Quinlan. Boosting first-order learning. Lecture Notes in Comp. Sci., 1160:143, 1996.
15. G. Rätsch. Robust Boosting via Convex Optimization. PhD thesis, University of Potsdam, October 2001. http://mlg.anu.edu.au/~raetsch/thesis.ps.gz.
16. G. Rätsch, A. Demiriz, and K. Bennett. Sparse regression ensembles in infinite and finite hypothesis spaces. Machine Learning, 48(1-3):193-221, 2002. Special Issue on New Methods for Model Selection and Model Combination. Also NeuroCOLT2 Technical Report 2000-085.
17. G. Rätsch, T. Onoda, and K.-R. Müller. Soft margins for AdaBoost. Machine Learning, 42(3):287-320, March 2001. also NeuroCOLT Technical Report NC-TR- 1998-021.
18. R.E. Schapire. The Design and Analysis of Efficient Learning Algorithms. PhD thesis, MIT Press, 1992.
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. Annals of Statistics, 26(5):1651 ff., 1998.
20. R.E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):297-336, December 1999.
21. Proceedings of the 14th Workshop on Computational Learning Theory 1998, pages 80-91.
22. L.G. Valiant. A theory of the learnable. Comm. of the ACM, 27(11):1134-1142, 1984.
23. J. von Neumann. Zur Theorie der Gesellschaftsspiele. Math. Ann., 100:295-320, 1928.
24. T. Zhang. Sequential greedy approximation for certain convex optimization problems. Technical report, IBM T.J. Watson Research Center, 2002.