Algorithmic stability and generalization performance

Advances in Neural Information Processing Systems

Volumn , Issue , 2001, Pages

  Bousquet, Olivier ^a   Elisseeff, André ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b Barnhill Technologies   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; STABILITY;

ALGORITHMIC STABILITY; GENERALIZATION ERROR; GENERALIZATION PERFORMANCE; HYPOTHESIS SPACE; REGULARIZATION NETWORKS; STABILITY PROPERTIES; TRAINING SETS; VC DIMENSION;

LEARNING ALGORITHMS;

EID: 84898936190     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler. Scale-sensitive dimensions, uniform convergence and learnability. Journal of the ACM, 44(4):615-631, 1997.
2. N. Aronszajn. Theory of reproducing kernels. Trans. Amer. Math. Soc., 68:337-404, 1950.
3. M. Atteia. Hilbertian Kernels and splines functions. Studies in computational mathematics 4. North-Holland, 1992.
4. L.P. Devroye and T.J. Wagner. Distribution-free performance bounds for potential function rules. IEEE Trans. on Information Theory, 25(5):202-207, 1979.
5. A. Elisseeff. A study about algorithmic stability and its relation to generalization performances. Technical report, Laboratoire ERIC, Univ. Lyon 2, 2000.
6. T. Evgeniou, M. Pontil, and T. Poggio. A unified framework for regularization networks and support vector machines. Technical Memo AIM-1654, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, December 1999.
7. Y. Freund. Self bounding learning algorithms. In Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT-98), pages 247-258, New York, July 24-26 1998. ACM Press.
8. M. Kearns and D. Ron. Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 11(6):1427-1453, 1999.
9. C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, 1989.
10. T. Poggio and F. Girosi. Regularization algorithms for learning that are equivalent to multilayer networks. Science, 247:978-982, 1990.
11. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. A framework for structural risk minimization. In Proc. 9th Annu. Conf. on Comput. Learning Theory, pages 68-76. ACM Press, New York, NY, 1996.
12. J. Shawe-Taylor and R. C. Williamson. Generalization performance of classifiers in terms of observed covering numbers. In Paul Fischer and Hans Ulrich Simon, editors, Proceedings of the 4th European Conference on Computational Learning Theory (Eurocolt-99), Volume 1572 of LNAI, pages 274-284, Berlin, March 29-31 1999. Springer.