lec14 - Suggested Reading • V N Vapnik Statistical...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 14: Generalization Bounds and Stability Alex Rakhlin Description We introduce the notion of generalization bounds, which allow us to have confidence in the functions our algorithms are finding. We introduce the notion of algorithmic stability, and explore the connection between algorithmic stability and generalization bounds.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Suggested Reading • V. N. Vapnik. Statistical Learning Theory. Wiley, 1998. • F. Cucker and S. Smale. On The Mathematical Foundations of Learning. Bulletin of the American Mathematical Society, 2002. • O. Bousquet and A. Elisseeff. Stability and Generalization. Journal of Machine Learning Research....
View Full Document

This note was uploaded on 11/11/2011 for the course BIO 9.07 taught by Professor Ruthrosenholtz during the Spring '04 term at MIT.

Ask a homework question - tutors are online