Hypothesis spaces for learning

DOI10.1016/J.IC.2010.11.016MaRDI QIDQ553319zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Hypothesis Spaces for Learning
• Changing the inference type -- keeping the hypothesis space
• scientific article; zbMATH DE number 791077
• scientific article; zbMATH DE number 1351096
• Prescribed learning of r.e. classes

Cites work

• A connotational theory of program structure
• A general comparison of language learning from examples and from queries
• Algorithmic Learning Theory
• Characterizations of monotonic and dual monotonic language learning
• Comparison of identification criteria for machine inductive inference
• Control structures in hypothesis spaces: The influence on learning
• Criteria of language learning
• Finding patterns common to a set of strings
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Incremental learning from positive data
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of automata, functions and programs
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning in Friedberg numberings
• Learning recursive functions: A survey
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Learning strategies
• Learning with the knowledge of an upper bound on program size
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• Numberings Optimal for Learning
• Prescribed learning of indexed families
• Prescribed learning of r.e. classes
• Prudence and other conditions on formal language learning
• Recursively enumerable sets of positive integers and their decision problems
• Set-driven and rearrangement-independent learning of recursive languages
• The independence of control structures in abstract programming systems
• The Power of Vacillation in Language Learning
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Toward a mathematical theory of inductive inference
• When unlearning helps

Cited in

(14)

• Prescribed learning of r.e. classes
• Learning from a population of hypotheses
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Learning families of algebraic structures from informant
• Parametric version space approach to concept learning
• Effectivity questions for Kleene's recursion theorem
• Effectivity questions for Kleene's recursion theorem
• Prescribed Learning of R.E. Classes
• Hypothesis Spaces for Learning
• scientific article; zbMATH DE number 1966620 (Why is no real title available?)
• scientific article; zbMATH DE number 791077 (Why is no real title available?)
• Changing the inference type -- keeping the hypothesis space
• Control structures in hypothesis spaces: The influence on learning
• On the learnability of vector spaces

This page was built for publication: Hypothesis spaces for learning

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