Hypothesis Spaces for Learning

DOI10.1007/978-3-642-00982-2_4zbMath1234.68168OpenAlexW2669992204MaRDI QIDQ3618566

Sanjay Jain

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.7964

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• Learning recursive functions: A survey
• When unlearning helps
• Learning in Friedberg numberings
• Finding patterns common to a set of strings
• Learning with the knowledge of an upper bound on program size
• Incremental learning from positive data
• Characterizations of monotonic and dual monotonic language learning
• A general comparison of language learning from examples and from queries
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Learning strategies
• Inductive Inference and Computable One‐One Numberings
• Prescribed Learning of R.E. Classes
• Numberings Optimal for Learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Set-driven and rearrangement-independent learning of recursive languages
• Algorithmic Learning Theory
• Language identification in the limit
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Hypothesis Spaces for Learning