A new composition theorem for learning algorithms

A theory of the learnable

Communications of the ACM

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)

Mistake bounds and logarithmic linear-threshold learning algorithms

Mistake bounds and logarithmic linear-threshold learning algorithms

Learning Nested Differences of Intersection-Closed Concept Classes

Machine Learning

On-line learning of rectangles

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

Learning in the presence of malicious errors

SIAM Journal on Computing

Efficient noise-tolerant learning from statistical queries

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

On-line learning of rectangles in noisy environments

COLT '93 Proceedings of the sixth annual conference on Computational learning theory

Noise-tolerant distribution-free learning of general geometric concepts

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

A composition theorem for learning algorithms with applications to geometric concept classes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Queries and Concept Learning

Machine Learning

Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

Machine Learning

Queries and Concept Learning

Machine Learning

Learning decision lists and trees with equivalence-queries

EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory