Systems that learn: an introduction to learning theory for cognitive and computer scientists
Systems that learn: an introduction to learning theory for cognitive and computer scientists
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Conflict Resolution as Discovery in Particle Physics
Machine Learning
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On the role of procrastination in machine learning
Information and Computation
On the intrinsic complexity of learning
Information and Computation
The intrinsic complexity of language identification
Journal of Computer and System Sciences
Ordinal mind change complexity of language identification
Theoretical Computer Science
The synthesis of language learners
Information and Computation
Mind change complexity of learning logic programs
Theoretical Computer Science
Language Learning with a Bounded Number of Mind Changes
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Inductive Inference with Bounded Mind Changes
ALT '92 Proceedings of the Third Workshop on Algorithmic Learning Theory
Derived Sets and Inductive Inference
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Learning, Logic, and Topology in a Common Framework
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Justification as truth-finding efficiency: how Ockham's Razor works
Minds and Machines - Machine learning as experimental philosophy of science
Mind change efficient learning
Information and Computation
Mind change optimal learning of Bayes net structure from dependency and independency data
Information and Computation
Mind change efficient learning
Information and Computation
Theoretical Computer Science
Mind change optimal learning of Bayes net structure
COLT'07 Proceedings of the 20th annual conference on Learning theory
Mind change complexity of inferring unbounded unions of pattern languages from positive data
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Compute inclusion depth of a pattern
COLT'05 Proceedings of the 18th annual conference on Learning Theory
| Hi-index | 0.00 |
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind changes not only globally in the entire learning problem, but also locally in subproblems after receiving some evidence. Formalizing this idea leads to the notion of uniform mind change optimality. We characterize the structure of language classes that can be identified with at most α mind changes by some learner (not necessarily effective): A language class ${\mathcal L}$ is identifiable with α mind changes iff the accumulation order of ${\mathcal L}$ is at most α. Accumulation order is a classic concept from point-set topology. To aid the construction of learning algorithms, we show that the characteristic property of uniformly mind change optimal learners is that they output conjectures (languages) with maximal accumulation order. We illustrate the theory by describing mind change optimal learners for various problems such as identifying linear subspaces and one-variable patterns.