Letters to Nature
Nature 428, 419-422 (25 March 2004) | doi:10.1038/nature02341; Received 3 November 2003; Accepted 16 January 2004
General conditions for predictivity in learning theory
Tomaso Poggio1, Ryan Rifkin1,4, Sayan Mukherjee1,3 and Partha Niyogi2
- Center for Biological and Computational Learning, McGovern Institute Computer Science Artificial Intelligence Laboratory, Brain Sciences Department, MIT, Cambridge, Massachusetts 02139, USA
- Departments of Computer Science and Statistics, University of Chicago, Chicago, Illinois 60637, USA
- Cancer Genomics Group, Center for Genome Research/Whitehead Institute, MIT, Cambridge, Massachusetts 02139, USA
- Honda Research Institute USA Inc., Boston, Massachusetts 02111, USA
Correspondence to: Tomaso Poggio1 Email: tp@ai.mit.edu
Developing theoretical foundations for learning is a key step towards understanding intelligence. 'Learning from examples' is a paradigm in which systems (natural or artificial) learn a functional relationship from a training set of examples. Within this paradigm, a learning algorithm is a map from the space of training sets to the hypothesis space of possible functional solutions. A central question for the theory is to determine conditions under which a learning algorithm will generalize from its finite training set to novel examples. A milestone in learning theory1, 2, 3, 4, 5 was a characterization of conditions on the hypothesis space that ensure generalization for the natural class of empirical risk minimization (ERM) learning algorithms that are based on minimizing the error on the training set. Here we provide conditions for generalization in terms of a precise stability property of the learning process: when the training set is perturbed by deleting one example, the learned hypothesis does not change much. This stability property stipulates conditions on the learning map rather than on the hypothesis space, subsumes the classical theory for ERM algorithms, and is applicable to more general algorithms. The surprising connection between stability and predictivity has implications for the foundations of learning theory and for the design of novel algorithms, and provides insights into problems as diverse as language learning and inverse problems in physics and engineering.
MORE ARTICLES LIKE THIS
These links to content published by NPG are automatically generated.
NEWS AND VIEWS
Models of nitrogen fixationNature News and Views (03 Jan 1975)
Learning theory Past performance and future resultsNature News and Views (25 Mar 2004)
