Leave-one-out bounds for kernel methods

Neural Computation

Volumn 15, Issue 6, 2003, Pages 1397-1437

  Zhang, Tong ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042879446     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976603321780326     Document Type: Article

References (25)

1. Birgé, L., & Massart, P. (1993). Rates of convergence for minimum contrast estimators. Probab. Theory Related Fields, 97(1-2), 113-150.
2. Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499-526.
3. Chucker, P., & Samle, S. (2002). On the mathematical foundations of learning. Bulletin (New Series) of the American Mathematical Society, 39(1), 1-49.
4. Cristianini, N., & Shawe-Taylor, J. (2000). An introduction to support vector machines and other kernel-based learning methods. Cambridge: Cambridge University Press.
5. Efron, B., & Stein, C. (1981). The jackknife estimate of variance. Ann. Statist., 9(3), 586-596.
6. Evgeniou, T., Pontil, M., & Poggio, T. (2000). Regularization networks and support vector machines. Advances in Computational Mathematics, 13(1), 1-50.
7. Forster, J., & Warmuth, M. (2000). Relative expected instantaneous loss bounds. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (pp. 90-99). San Mateo, CA: Morgan Kaufmann.
8. Jaakkola, T., & Haussler, D. (1999). Probabilistic kernel regression models. In Proceedings of the 1999 Conference on AI and Statistics. San Mateo, CA: Morgan Kaufmann.
9. Joachims, T. (2000). Estimating the generalization performance of an SVM efficiently. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML 00) (pp. 431-438). San Mateo, CA: Morgan Kaufmann.
10. Kearns, M., & Ron, D. (1999). Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 21(6), 1427-1453.
11. Kutin, S., & Niyogi, P. (2002). Almost-everywhere algorithmic stability and generalization error (Tech. Rep. TR-2002-03). Chicago: University of Chicago.
12. Mhaskar, H. N., Narcowich, F. J., & Ward, J. D. (1999). Approximation properties of zonal function networks using scattered data on the sphere. Adv. Comput. Math., 11(2-3), 121-137.
13. Narcowich, F. J., Sivakumar, N., & Ward, J. D. (1998). Stability results for scattered-data interpolation on Euclidean spheres. Adv. Comput. Math., 8(3), 137-163.
14. Rockafellar, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press.
15. Steele, J. M. (1986). An Efron-Stein inequality for nonsymmetric statistics. Ann. Statist., 14(2), 753-758.
16. van de Geer, S. (2000). Empirical processes in M-estimation. Cambridge: Cambridge University Press.
17. van der Vaart, A. W., & Wellner, J. A. (1996). Weak convergence and empirical processes. New York: Springer-Verlag.
18. Vapnik, V. (1998). Statistical learning theory. New York: Wiley.
19. Wahba, G. (1990). Spline models for observational data. Philadelphia: SIAM.
20. Wendland, H. (1998). Error estimates for interpolation by compactly supported radial basis functions of minimal degree. J. Approx. Theory, 93(2), 258-272.
21. Yang, Y., & Barron, A. (1999). Information-theoretic determination of minimax rates of convergence. Annals of Statistics, 27, 1564-1599.
22. Zhang, T. (2001). A leave-one-out cross validation bound for kernel methods with applications in learning. In 14th Annual Conference on Computational Learning Theory (pp. 427-443). Berlin: Springer-Verlag.
23. Zhang, T. (2002a). Generalization performance of some learning problems in Hilbert functional spaces. In T. G. Dietterich, S. Becker, & Z. Ghahramani (Eds.), Advances in neural information processing systems, 14. Cambridge, MA: MIT Press.
24. Zhang, T. (2002b). On the dual formulation of regularized linear systems. Machine Learning, 46, 91-129.
25. Zhang, T. (in press). Statistical behavior and consistency of classification methods based on convex risk minimization. Annals of Statitics.