Robust learning with infinite additional information

DOI10.1016/S0304-3975(00)00023-2MaRDI QIDQ5941287zbMATH OpenFDO

Authors S. Kaufmann, Frank Stephan

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00023-2

zbMATH Keywords

inductive inferencelearning of recursive functionsrobust access to oraclestransactions between learning models

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1804101
• Robust learning -- rich and poor
• Learning via queries and oracles
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Extremes in the degrees of inferability

Cites work

• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 3681745 (Why is no real title available?)
• scientific article; zbMATH DE number 3702094 (Why is no real title available?)
• scientific article; zbMATH DE number 67621 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 605140 (Why is no real title available?)
• scientific article; zbMATH DE number 2077149 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3316917 (Why is no real title available?)
• scientific article; zbMATH DE number 3404166 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Classical recursion theory. Vol. II
• Classifying Predicates and Languages
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Extremes in the degrees of inferability
• Inductive inference and unsolvability
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning in the presence of partial explanations
• Learning recursive functions from approximations
• Learning regular sets from queries and counterexamples
• Learning with the knowledge of an upper bound on program size
• Monotonic and non-monotonic inductive inference
• ON LEARNING LIMITING PROGRAMS
• On one-sided versus two-sided classification
• On the relative sizes of learnable sets
• On the structure of degrees of inferability.
• One-sided error probabilistic inductive inference and reliable frequency identification
• Some natural properties of strong-identification in inductive inference
• Synthesizing inductive expertise
• Toward a mathematical theory of inductive inference
• Trees and learning
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(4)

• Trees and learning
• Learning algebraic structures from text
• Robust learning -- rich and poor
• Predictive learning models for concept drift

This page was built for publication: Robust learning with infinite additional information

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