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

DOI10.1007/S10994-008-5047-9MaRDI QIDQ1009263zbMATH OpenOpenAlexFDO

Authors John Case, Samuel E. III Moelius

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

inductive inferenceiterative learningcomputational learning theorylanguage 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)

Recommendations

• U-Shaped, Iterative, and Iterative-with-Counter Learning
• Iterative learning from positive data and negative counterexamples
• Strongly non-U-shaped language learning results by general techniques
• Iterative Learning from Positive Data and Negative Counterexamples
• Variations on U-shaped learning

Cites work

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

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009263)