Hypothesis spaces for learning

DOI10.1016/j.ic.2010.11.016zbMath1217.68118OpenAlexW2032122957MaRDI QIDQ553319

Sanjay Jain

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.016

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (4)

Effectivity Questions for Kleene’s Recursion Theorem ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Learning families of algebraic structures from informant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• 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
• Prescribed learning of r.e. classes
• Finding patterns common to a set of strings
• The independence of control structures in abstract programming systems
• 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
• Numberings Optimal for Learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Inductive inference of automata, functions and programs
• The Power of Vacillation in Language Learning
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Set-driven and rearrangement-independent learning of recursive languages
• Criteria of language learning
• Algorithmic Learning Theory
• Language identification in the limit
• Recursively enumerable sets of positive integers and their decision problems
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Hypothesis spaces for learning