Robust learning -- rich and poor

DOI10.1016/J.JCSS.2003.10.005MaRDI QIDQ1880777zbMATH OpenOpenAlexFDO

Authors John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen

Publication date 1 October 2004

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2003.10.005

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1804101
• Robust learning is rich
• Robust learning with infinite additional information
• Robust behaviorally correct learning.
• Robust learning of automatic classes of languages

Cites work

• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 4055080 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 67627 (Why is no real title available?)
• scientific article; zbMATH DE number 3536063 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 1301802 (Why is no real title available?)
• scientific article; zbMATH DE number 517032 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (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
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• Avoiding coding tricks by hyperrobust learning
• Comparison of identification criteria for machine inductive inference
• Ignoring data may be the only way to learn efficiently
• Inductive inference of recursive functions: complexity bounds
• Inductive inference of recursive functions: qualitative theory
• Language identification in the limit
• Periodicity in generations of automata
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Robust behaviorally correct learning.
• Robust learning aided by context
• Robust learning is rich
• Robust separations in inductive inference
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference

Cited in

(15)

• Robust learning of automatic classes of languages
• Robust learning of automatic classes of languages
• Transformations that preserve learnability
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Learning all subfunctions of a function
• Robust learning is rich
• Learning all subfunctions of a function.
• Avoiding coding tricks by hyperrobust learning
• Learning recursive functions: A survey
• Robust learning with infinite additional information
• scientific article; zbMATH DE number 1804101 (Why is no real title available?)
• Robust separations in inductive inference
• Learning classes of approximations to non-recursive functions.
• Robust behaviorally correct learning.
• Robust identification in the limit from incomplete positive data

This page was built for publication: Robust learning -- rich and poor

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