Some properties of regularized kernel methods

Journal of Machine Learning Research

Volumn 5, Issue , 2004, Pages 1363-1390

  De Vito, Ernesto ^a,b   Rosasco, Lorenzo ^c   Caponnetto, Andrea ^c   Piana, Michele ^c   Verri, Alessandro ^c  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b INFN SEZIONE DI GENOVA   (Italy)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

Convex analysis; Regularization theory; Representer theorem; Reproducing kernel Hilbert spaces; Statistical learning

Indexed keywords

LEARNING ALGORITHMS; VECTOR SPACES;

CONVEX ANALYSIS; REGULARIZATION THEORY; REPRESENTER THEOREM; REPRODUCING KERNEL HILBERT SPACES; STATISTICAL LEARNING;

HILBERT SPACES;

EID: 23244462944     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. Peter L. Bartlett. Prediction algorithms: complexity, concentration and convexity. In Proceedings of the 13th IFAC Symposium on System Identification, pages 1507-1517, 2003.
2. Peter L. Bartlett, Olivier Bousquet, and Shahar Mendelson. Local Rademacher complexities. (submitted), 2002.
3. Peter L. Bartlett, Michael I. Jordan, and Jon D. McAuliffe. Convexity, classification, and risk bounds. Technical Report 638, Department of Statistics, U. C. Berkeley, 2003.
4. M. Bertero, T. Poggio, and V. Torre. Ill-posed problems in early vision. Proceedings of the IEEE, 76:869-889, 1988.
5. C. Burges and D. Crisp. Uniqueness of the SVM solution. In Proceedings of the Twelfth Conference on Neural Information Processing Systems, pages 223-229, Cambridge, MA, 2000. MIT Press.
6. C. Burges and D. Crisp. Uniqueness theorems for kernel methods. Neurocomputing, 55:187-220, 2003.
7. D. Cox and F. O'Sullivan. Asymptotic analysis of penalized likelihood and related estimators. Ann. Stat., 18:1676-1695, 1990.
8. N. Cristianini and J. Shawe Taylor. An Introduction to Support Vector Machines. Cambridge University Press, Cambridge, UK, 2000.
9. F. Cucker and S. Smale. Best choices for regularization parameters in learning theory: on the bias-variance problem. Foundations of Computationals Mathematics, 2:413-428, 2002.
10. I. Ekeland and R. Teman. Analyse convexe et problémes variationnels. Gauthier-Villards, Paris, 1974.
11. I. Ekeland and T. Turnbull. Infinite-dimensional Optimization and Convexity. Chicago Lectures in Mathematics. The University of Chicago Press, Chicago, 1983.
12. T. Evgeniou, Pontil M., and T. Poggio. Regularization networks and support vector machines. Adv. Comp. Math., 13:1-50, 2000.
13. F. Girosi. An equivalence between sparse approximation and support vector machines. Neural Computation, 10:1455-1480, 1998.
14. F. Girosi and N. Chan. Prior knowledge and the creation of virtual examples for rbf networks. In Proceedings of the IEEE-SP Workshop on Neural Networks Signal Processing, pages 201-210, Cambridge, MA, 1995. IEEE Signal Processing Society.
15. G. Kimeldorf and G. Wahba. A correspondence between Bayesian estimation of stochastic processes and smoothing by splines. Ann. Math. Stat., 41:495-502, 1970.
16. C. A. Micchelli and M. Pontil. On learning vector-valued functions. Research Note RN/03/08, Dept of Computer Science, UCL, 2003.
17. S. Mukherjee, P. Niyogi, T. Poggio, and R. Rifkin. Statistical learning: Stability is sufficient for generalization and necessary and sufficient for consistency for empirical risk minimization. C. B. C. L. Paper 223, Massachusetts Institute of Technology - Artificial Intelligence Laboratory, December 2002.
18. P. Niyogi and F. Girosi. Generalization bounds for function approximation from scattered data. Adv. Comp. Math., 10:51-80, 1999.
19. T. Poggio and F. Girosi. A theory of networks for approximation and learning. In C. Lau, editor, Foundation of Neural Networks, pages 91-106. IEEE Press, Piscataway, New Jersey, 1992.
20. T. Poggio, S. Mukherjee, R. Rifkin, A. Rakhlin, and A. Verri. B. In J. Winkler and M. Niranjan, editors, Uncertainty in Geometric Computations, pages 131-141. Kluwer Academic Publishers, 2002.
21. T. Poggio and S. Smale. The mathematics of learning: Dealing with data. Notices of the American Mathematical Society (AMS), 50:537-544, 2003.
22. B. Schölkopf, R. Herbrich, and A. J. Smola. A generalized representer theorem. In D. Helmbold and B. Williamson, editors, Neural Networks and Computational Learning Theory, number 81, pages 416-426. Springer, Berlin, Germany, 2001.
23. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002. URL http://www.learning-with-kernels.org.
24. L. Schwartz. Sous-espaces hilbertiens d'espaces vectorials topologiques and noyaux associès. Journal d'Analyse Mathematique, 13:115-256, 1964.
25. I. Steinwart. Consistency of support vector machines and other regularized kernel machines. submitted to IEEE Transactions on Information Theory, 2002.
26. I. Steinwart. Sparseness of support vector machines. Journal of Machine Learning Research, 4:1071-1105, 2003.
27. A. N. Tikhonov and V. Y. Arsenin. Solutions of Ill Posed Problems. W. H. Winston, Washington, D. C., 1977.
28. V. Vapnik. Statistical Learning Theory. Wiley, New York, 1988.
29. G. Wahba. Splines Models for Observational Data, volume 59 of Series in Applied Mathematics. SIAM, 1990.
30. G. Wahba. Support vector machines, reproducing kernel Hilbert spaces and randomized GACV. Technical Report 984, Department of Statistics, University of Wisconsin, 1998.
31. T. Zhang. Convergence of large margin separable linear classification. In T. G. Len, T. K. Dietterich and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 357-363. MIT Press, 2001.