The consistency of greedy algorithms for classification

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

Volumn 2375, Issue , 2002, Pages 319-333

  Mannor, Shie ^a   Meir, Ron ^a   Zhang, Tong ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

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

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; COMPUTATION THEORY; EXPONENTIAL FUNCTIONS; ITERATIVE METHODS;

BOOSTING ALGORITHM; CONSISTENCY RESULT; CONVEX UPPER BOUND; DECISION BOUNDARY; GREEDY ALGORITHMS; LOGISTIC FUNCTIONS; RATES OF CONVERGENCE; STATISTICAL CONSISTENCIES;

ALGORITHMS;

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

References (20)

1. R. A. Adams. Sobolev Spaces. Academic Press, New York, 1975.
2. M. Anthony and P. L. Bartlett. Neural Network Learning; Theoretical Foundations. Cambridge University Press, 1999.
3. P. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: risk bounds and structural results. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, pages 224-240, 2001.
4. L. Breiman. Arcing classifiers. The Annals of Statistics, 26(3):801-824, 1998.
5. Y. Freund and R. E. Schapire. A decision theoretic generalization of on-line learning and application to boosting. Comput. Syst. Sci., 55(1):119-139, 1997.
6. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. The Annals of Statistics, 38(2):337-374, 2000.
7. W. Jiang. Does boosting overfit: Views from an exact solution. Technical Report 00-03, Department of Statistics, Northwestern University, 2000.
8. W. Jiang. Process consistency for adaboost. Technical Report 00-05, Department of Statistics, Northwestern University, 2000.
9. V. Koltchinksii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Ann. Statis., 30(1), 2002.
10. G. Lugosi and N. Vayatis. On the bayes-risk consistency of bosting methods. Technical report, Pompeu Fabra University, 2001.
11. S. Mannor and R. Meir. Geometric bounds for generlization in boosting. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, pages 461-472, 2001.
12. S. Mannor and R. Meir. On the existence of weak learners and applications to boosting. Machine Learning, 2002. To appear.
13. L. Mason, P. Bartlett, J. Baxter, and M. Frean. Functional gradient techniques for combining hypotheses. In B. Schölkopf A. Smola, P. Bartlett and D. Schuurmans, editors, Advances in Large Margin Classifiers. MIT Press, 2000.
14. R. Meir and V. Maiorov. On the optimality of neural network approximation using incremental algorithms. IEEE Trans. Neural Networks, 11(2):323-337, 2000.
15. D. Pollard. Convergence of Empirical Processes. Springer Verlag, New York, 1984.
16. R. Schapire. The strength of weak learnability. Machine Learning, 5(2):197-227, 1990.
17. A.W. van der Vaart and J. A. Wellner. Weak Convergence and EmpiricalProcesses. Springer Verlag, New York, 1996.
18. Y. Yang. Minimax nonparametric classification - patr i: rates of convergence. IEEE Trans. Inf. Theory, 45(7):2271-2284, 1999.
19. T. Zhang. Statistical behavior and consistency of classification methods based on convex risk minimization. Technical Report RC22155, IBM T. J. Watson Research Center, Yorktown Heights, 2001.
20. T. Zhang. Sequential greedy approximation for certain convex optimization problems. Technical Report RC22309, IBM T. J. Watson Research Center, Yorktown Heights, 2002.