Conservativeness and monotonicity for learning algorithms

A theory of the learnable

Communications of the ACM

Occam's razor

Information Processing Letters

Crytographic limitations on learning Boolean formulae and finite automata

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)

Boosting a weak learning algorithm by majority

COLT '90 Proceedings of the third annual workshop on Computational learning theory

Equivalence of models for polynomial learnability

COLT '88 Proceedings of the first annual workshop on Computational learning theory

On the necessity of Occam algorithms

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

An improved boosting algorithm and its implications on learning complexity

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory