Rigorous learning curve bounds from statistical mechanics

48Citations
Citations of this article
66Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over the well-established Vapnik-Chervonenkis theory is that our bounds can be considerably tighter in many cases, and are also more reflective of the true behavior (functional form) of learning curves. This behavior can often exhibit dramatic properties such as phase transitions, as well as power law asymptotics not explained by the VC theory. The disadvantages of our theory are that its application requires knowledge of the input distribution, and it is limited so far to finite cardinality function classes. We illustrate our results with many concrete examples of learning curve bounds derived from our theory.

Cite

CITATION STYLE

APA

Haussler, D., Seung, H. S., Kearns, M., & Tishby, N. (1994). Rigorous learning curve bounds from statistical mechanics. In Proceedings of the Annual ACM Conference on Computational Learning Theory (pp. 76–87). Association for Computing Machinery. https://doi.org/10.1145/180139.181018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free