Statistical behavior and consistency of classification methods based on convex risk minimization

Annals of Statistics

Volumn 32, Issue 1, 2004, Pages 56-134

  Zhang, Tong ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Boosting; Classification; Consistency; Kernel methods; Large margin methods

Indexed keywords

EID: 4644257995     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/aos/1079120130     Document Type: Article

References (18)

1. BREGMAN, L. M. (1967). The relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Computational Mathematics and Mathematical Physics 7 200-217.
2. BREIMAN, L. (1998). Arcing classifiers (with discussion). Ann. Statist. 26 801-849.
3. BREIMAN, L. (1999). Prediction games and arcing algorithms. Neural Computation 11 1493-1517.
4. BREIMAN, L. (2000). Some infinity theory for predictor ensembles. Technical Report 577, Dept. Statistics, Univ. California, Berkeley.
5. 2-loss: Regression and classification. J. Amer. Statist. Assoc. 98 324-339.
6. FREUND, Y. and SCHAPIRE, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. System Sci. 55 119-139.
7. FRIEDMAN, J., HASTIE, T. and TIBSHIRANI, R. (2000). Additive logistic regression: A statistical view of boosting (with discussion). Ann. Statist. 28 337-407.
8. LESHNO, M., LIN, YA. V., PINKUS, A. and SCHOCKEN, S. (1993). Multilayer feedforward networks with a non-polynomial activation function can approximate any function. Neural Networks 6 861-867.
9. LUGOSI, G. and VAYATIS, N. (2004). On the Bayes-risk consistency of regularized boosting methods. Ann. Statist. 32 30-55.
10. MANNOR, S., MEIR, R. and ZHANG, T. (2002). The consistency of greedy algorithms for classification. In Proc. 15th Annual Conference on Computational Learning Theory. Lecture Notes in Comput. Sci. 2375 319-333. Springer, New York.
11. ROCKAFELLAR, R. T. (1970). Convex Analysis. Princeton Univ. Press.
12. RUDIN, W. (1987). Real and Complex Analysis, 3rd ed. McGraw-Hill, New York.
13. SCHAPIRE, R. E., FREUND, Y., BARTLETT, P. and LEE, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. Ann. Statist. 26 1651-1686.
14. SCHAPIRE, R. E. and SINGER, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning 37 297-336.
15. STEINWART, I. (2002). Support vector machines are universally consistent. J. Complexity 18 768-791.
16. VAPNIK, V. N. (1998). Statistical Learning Theory. Wiley, New York.
17. WAHBA, G. (1990). Spline Models for Observational Data. SIAM, Philadelpfia.
18. ZHANG, T. (2001). A leave-one-out cross validation bound for kernel methods with applications in learning. In Proc. 14th Annual Conference on Computational Learning Theory 427-443. Springer, New York.