Computational learning theory: survey and selected bibliography

A theory of the learnable

Communications of the ACM

Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing

On the learnability of Boolean formulae

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

On learning Boolean functions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Occam's razor

Information Processing Letters

Learning regular sets from queries and counterexamples

Information and Computation

Learning from good and bad data

Learning from good and bad data

Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

Artificial Intelligence

Learning in the presence of malicious errors

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Computational limitations on learning from examples

Journal of the ACM (JACM)

Inference of finite automata using homing sequences

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

The minimum consistent DFA problem cannot be approximated within and polynomial

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

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)

The computational complexity of machine learning

The computational complexity of machine learning

On learning a union of half spaces

Journal of Complexity

Negative Results for Equivalence Queries

Machine Learning

Learning Nested Differences of Intersection-Closed Concept Classes

Machine Learning

Proceedings of the third annual workshop on Computational learning theory

COLT90 3rd Annual Workshop on Computational Learning Theory

Identifying μ-formula decision trees with queries

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

Learning switch configurations

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

On the computational complexity of approximating distributions by probabilistic automata

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

A learning criterion for stochastic rules

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

Pattern languages are not learnable

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

Learning functions of k terms

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

Boosting a weak learning algorithm by majority

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

On the sample complexity of weak learning

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

Learning by distances

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

The learnability of formal concepts

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

Polynomial time algorithms for learning neural nets

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

Composite geometric concepts and polynomial predictability

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

Learning integer lattices

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

Learning DNF under the uniform distribution in quasi-polynomial time

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

Aggregating strategies

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

Proceedings of the first annual workshop on Computational learning theory

COLT88 1988 Working on Computational Learning Theory

Functionality in neural nets

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

Equivalence of models for polynomial learnability

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

Learning complicated concepts reliably and usefully

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

Learnability by fixed distributions

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

Types of noise in data for concept learning

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

Learning k-DNF with noise in the attributes

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

Learning decision trees from random examples

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

Learning regular languages from counterexamples

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

Learning automata from ordered examples

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

Proceedings of the second annual workshop on Computational learning theory

COLT'89 2nd Workshop on Computational Learning Theory

Polynomial learnability of semilinear sets

COLT '89 Proceedings of the second annual workshop on Computational learning theory

A polynomial-time algorithm for learning k-variable pattern languages from examples

COLT '89 Proceedings of the second annual workshop on Computational learning theory

On learning from exercises

COLT '89 Proceedings of the second annual workshop on Computational learning theory

Learning simple deterministic languages

COLT '89 Proceedings of the second annual workshop on Computational learning theory

A parametrization scheme for classifying models of learnability

COLT '89 Proceedings of the second annual workshop on Computational learning theory

Learning context-free grammars from structural data in polynomial time

Theoretical Computer Science

Space-bounded learning and the Vapnik-Chervonenkis dimension

COLT '89 Proceedings of the second annual workshop on Computational learning theory

Reliable and useful learning

COLT '89 Proceedings of the second annual workshop on Computational learning theory

Prediction-preserving reducibility

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988

On the necessity of Occam algorithms

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

Public-key cryptosystems provably secure against chosen ciphertext attacks

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

When won't membership queries help?

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Learning decision trees using the Fourier spectrum

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

On-line learning of linear functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Teachability in computational learning

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990

On learning from queries and counterexamples in the presence of noise

Information Processing Letters

Proceedings of the fourth annual workshop on Computational learning theory

COLT'91 4th Annual Workshop on Computational Learning Theory

Tracking drifting concepts using random examples

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Probably almost Bayes decisions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

On the learnability of infinitary regular sets

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning monotone DNF with an incomplete membership oracle

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning in the presence of finitely or infinitely many irrelevant attributes

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

On-line learning with an oblivious environment and the power of randomization

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning monotone ku DNF formulas on product distributions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning probabilistic read-once formulas on product distributions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning 2u DNF formulas and ku decision trees

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Polynomial-time learning of very simple grammars from positive data

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

On the complexity of teaching

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Improved learning of AC0 functions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Learning read-once formulas over fields and extended bases

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Fast identification of geometric objects with membership queries

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

On the complexity of learning strings and sequences

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Machine learning: a theoretical approach

Machine learning: a theoretical approach

Exact learning of read-twice DNF formulas (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Learning arithmetic read-once formulas

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Fast learning of k-term DNF formulas with queries

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

On learning ring-sum-expansions

SIAM Journal on Computing

The design and analysis of efficient learning algorithms

The design and analysis of efficient learning algorithms

Learning in parallel

Information and Computation

Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)

Learning Conjunctive Concepts in Structural Domains

Machine Learning

On Learning Sets and Functions

Machine Learning

Learning Decision Lists

Machine Learning

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 From Noisy Examples

Machine Learning

A New Model for Inductive Inference

Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge

Learning Read-Once Formulas with Queries

Learning Read-Once Formulas with Queries

On space-bounded learning and the vapnik-chervonenkis dimension

On space-bounded learning and the vapnik-chervonenkis dimension

On characterizing and learning some classes of read-once functions

On characterizing and learning some classes of read-once functions

Learning binary relations, total orders, and read-once formulas

Learning binary relations, total orders, and read-once formulas