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
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Prudence and other conditions on formal language learning
Information and Computation
Journal of the ACM (JACM)
On the power of inductive inference from good examples
Theoretical Computer Science
On the role of procrastination in machine learning
Information and Computation
Regular Article: Open problems in “systems that learn”
Proceedings of the 30th IEEE symposium on Foundations of computer science
Complexity issues for vacillatory function identification
Information and Computation
Language learning with some negative information
Journal of Computer and System Sciences
Language learning from texts: mindchanges, limited memory, and monotonicity
Information and Computation
Incremental concept learning for bounded data mining
Information and Computation
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
The Power of Pluralism for Automatic Program Synthesis
Journal of the ACM (JACM)
The Power of Vacillation in Language Learning
SIAM Journal on Computing
Generalization and specialization strategies for learning r.e. languages
Annals of Mathematics and Artificial Intelligence
Characterization Problems in the Theory of Inductive Inference
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Three Decades of Team Learning
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Monotonic Versus Nonmonotonic Language Learning
Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic
Learning in Friedberg numberings
Information and Computation
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Solutions to open questions for non-u-shaped learning with memory limitations
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Optimal language learning from positive data
Information and Computation
Some recent results in u-shaped learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Memory-limited non-U-shaped learning with solved open problems
Theoretical Computer Science
Hi-index | 0.00 |
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science literature is occupied with how humans do it, for example, general rules versus tables of exceptions. This paper is mostly concerned with whether U-shaped learning behaviour may be necessary in the abstract mathematical setting of inductive inference, that is, in the computational learning theory following the framework of Gold. All notions considered are learning from text, that is, from positive data. Previous work showed that U-shaped learning behaviour is necessary for behaviourally correct learning but not for syntactically convergent, learning in the limit (= explanatory learning). The present paper establishes the necessity for the hierarchy of classes of vacillatory learning where a behaviourally correct learner has to satisfy the additional constraint that it vacillates in the limit between at most b grammars, where b@?{2,3,...,*}. Non-U-shaped vacillatory learning is shown to be restrictive: every non-U-shaped vacillatorily learnable class is already learnable in the limit. Furthermore, if vacillatory learning with the parameter b=2 is possible then non-U-shaped behaviourally correct learning is also possible. But for b=3, surprisingly, there is a class witnessing that this implication fails.