Totally corrective boosting algorithms that maximize the margin

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 1001-1008

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

^a UNIVERSITY OF CALIFORNIA   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ERROR CORRECTION; ITERATIVE METHODS; LEARNING SYSTEMS;

ADABOOST; BOOSTING ALGORITHMS; CORRECTIVE ALGORITHMS; LINEAR CONSTRAINTS;

ADAPTIVE ALGORITHMS;

EID: 34250707319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143970     Document Type: Conference Paper

References (20)

1. Bennett, K., Demiriz, A., & Shawe-Taylor, J. (2000). A column generation algorithm for boosting. Proc. ICML (pp. 65-72). Morgan Kaufmann.
2. Bregman, L. (1967). The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Math. and Math. Physics, 7, 200-127.
3. Breiman, L. (1997). Prediction games and arcing algorithmsTechnical Report 504). Statistics Department, University of California at Berkeley.
4. Breiman, L. (1999). Prediction games and arcing algorithms. Neural Computation, 11, 1493-1518.
5. Duffy, N., & Helmbold, D. (2000). Potential boosters? NIPS'00 (pp. 258-264).
6. Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. of Comp. & Sys. Sci., 55, 119-139.
7. Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive Logistic Regression: a statistical view of boosting. Annals of Statistics, 2, 337-374.
8. Grove, A., & Schuurmans, D. (1998). Boosting in the limit: Maximizing the margin of learned ensembles. Proc. 15th Nat. Conf., on Art. Int.
9. Herbster, M., & Warmuth, M. (2001). Tracking the best linear prediction. J. Mach. Learn. Res., 281-309.
10. Kivinen, J., & Warmuth, M. (1999). Boosting as entropy projection. COLT'99.
11. Lafferty, J. (1999). Additive models, boosting, and inference for generalized divergences. COLT'99 (pp. 125-133).
12. Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
13. Long, P. M., & Wu, X. (2005). Mistake bounds for maximum entropy discrimination. NIPS'04 (pp. 833-840).
14. Nocedal, J., & Wright, S. (2000). Numerical optimization. Springer Series in Op. Res. Springer.
15. Rätsch, G., Onoda, T., & Müller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42, 287-320.
16. Rätsch, G., & Warmuth, M. K. (2005). Efficient margin maximizing with boosting. J. Mach. Learn. Res., 2131-2152.
17. Rudin, C., Daubechies, I., & Schapire, R. (2004a). Dynamics of AdaBoost: Cyclic behavior and convergence of margins. J. Mach. Learn. Res., 1557-1595.
18. Rudin, C., Schapire, R., & Daubechies, I. (2004b). Analysis of boosting algoritms using the smooth margin function: A study of three algorithms. Unpublished manuscript.
19. Schapire, R., Freund, Y., Bartlett, P., & Lee, W. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26, 1651-1686.
20. Schapire, R., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37, 297-336.