Stability and Generalization

Journal of Machine Learning Research

Volumn 2, Issue 3, 2002, Pages 499-526

  Bousquet, Olivier ^a   Elisseeff, André ^b  

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

^b BIOwulf Technologies   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038368335     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244302760200704     Document Type: Article

References (24)

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. P. Bartlett For valid generalization, the size of the weights is more important than the size of the network Advances in Neural Information Processing Systems, 1996.
3. J.F. Bonnans and A. Shapiro. Optimization problems with perturbation, a guided tour. Technical Report 2872, INRIA, April 1996.
4. O. Bousquet and A. Elisseeff. Algorithmic stability and generalization performance. In Neural Information Processing Systems 14, 2001.
5. L. Breiman. Bagging predictors. Machine Learning, 24:123-140, 1996a.
6. L. Breiman. Heuristics of instability and stabilization in model selection. Annals of Statistics, 24 (6):2350-2383, 1996b.
7. T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley, 1991.
8. L. Devroye. Exponential inequalities in nonparametric estimation. In Nonparametric Functional Estimation and Related Topics, pages 31-44. Kluwer Academic Publishers, 1991.
9. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer Verlag, 1996.
10. L. Devroye and T. Wagner. Distribution-free inequalities for the deleted and holdout error estimates. IEEE Transactions on Information Theory, 25(2):202-207, 1979a.
11. L. Devroye and T. Wagner. Distribution-free performance bounds for potential function rules. IEEE Transactions on Information Theory, 25(5):601-604, 1979b.
12. T. Evgeniou and M. Pontil and T. Poggio. A unified framework for Regularization Networks and Support Vector Machines. A.I. Memo 1654, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, December 1999.
13. G. Gordon. Approximate Solutions to Markov Decision Processes. PhD thesis, Carnegie Mellon University, 1999.
14. T. Jaakola, M. Meila, and T. Jebara. Maximum entropy discrimination. In Neural Information Processing Systems 12, 1999.
15. M. Kearns and D. Ron. Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 11(6):1427-1453, 1999.
16. G. Lugosi and M. Pawlak. On the posterior-probability estimate of the error of nonparametric classification rules. IEEE Transactions on Information Theory, 40(2):475-481, 1994.
17. C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, 1989.
18. T. Poggio and F. Girosi. Regularization algorithms for learning that are equivalent to multilayer networks. In Science, 247(2):978-982, 1990.
19. R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
20. W. Rogers and T. Wagner. A finite sample distribution-free performance bound for local discrimination rules. Annals of Statistics, 6(3):506-514, 1978.
21. J.M. Steele. An Efron-Stein inequality for nonsymmetric statistics. Annals of Statistics, 14:753-758, 1986.
22. M. Talagrand. A new look at independence. Annals of Probability, 24:1-34, 1996.
23. V.N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer-Verlag, 1982.
24. G. Wahba. An introduction to model building with reproducing kernel hilbert spaces. Technical Report Statistics Department TR 1020, University of Wisconsin, Madison, 2000.