Computational learning theory
Dana Angluin A · ACM Symposium on Theory of Computing (STOC) · 1992
Give a rigorous, computationally detailed and plausible account of how learning can be done.
Cited by 316 works. doi:10.1145/129712.129746 Open-access PDF
Authors
References
- A Theory of the Learnable
- How to construct random functions
- Inductive Inference: Theory and Methods
- Learnability and the Vapnik-Chervonenkis dimension
- Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
- Boosting a Weak Learning Algorithm by Majority
- Occam's Razor
- Queries and Concept Learning
- Learning Decision Lists
- Computational limitations on learning from examples