U-shaped, iterative, and iterative-with-counter learning

DOI10.1007/s10994-008-5047-9zbMath1470.68053OpenAlexW1969055113MaRDI QIDQ1009263

Samuel E. III Moelius, John Case

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-008-5047-9

zbMATH Keywords

computational learning theoryinductive inferencelanguage learningiterative learningnon-U-shaped learningGold-style learningiterative-with-counter learningmemory-limited learningpartly set-driven learningrearrangement-independent learningset-driven learningU-shaped learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Memory and learning in psychology (91E40)

Related Items (9)

Strongly non-U-shaped language learning results by general techniques ⋮ Iterative learning from positive data and counters ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Optimal language learning from positive data ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Parallelism increases iterative learning power ⋮ Iterative Learning from Texts and Counterexamples Using Additional Information ⋮ On the role of update constraints and text-types in iterative learning ⋮ Towards a map for incremental learning in the limit from positive and negative information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Polynomial-time inference of arbitrary pattern languages
• Prudence and other conditions on formal language learning
• When unlearning helps
• Non-U-shaped vacillatory and team learning
• Finding patterns common to a set of strings
• Incremental learning from positive data
• Incremental concept learning for bounded data mining.
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Results on memory-limited U-shaped learning
• Variations on U-shaped learning
• The Power of Vacillation in Language Learning
• Set-driven and rearrangement-independent learning of recursive languages
• U-Shaped, Iterative, and Iterative-with-Counter Learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: U-shaped, iterative, and iterative-with-counter learning