Abstract
Many (algorithmic) learning theories have been developed. The one which is now most often considered originated with L. Valiant (1984) and is called PAC-learning. In this chapter we show an interesting connection between PAC-learning and the principal known as “Occam’s Razor.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.G. Valiant: A theory of the learnable, Communications of the ACM 27 (1984), 1134–1142.
A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth: Occam’s Razor, Information Processing Letters 24 (1987), 377–380.
A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth: Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM 36 (1989), 929–965.
R. Board, L. Pitt: On the necessity of Occam algorithms, Proceedings of the 22nd Symposium on Theory of Computing, ACM, 1990, 54-63.
D. Angluin: Computational learning theory: survey and selected bibliography, Proceedings of the 24th Symposium on Theory of Computing, ACM, 1992, 351-369.
B. Natarajan: Machine Learning, Morgan Kaufmann, 1991.
M. Anthony, N. Biggs: Computational Learning Theory, Cambridge University Press, 1992.
M. Li, P. Vitanyi: An Introduction to Kolmogorov Complexity and its Applications j 2nd edition, Springer, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). PAC-Learning and Occam’s Razor. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive