Robust learning -- rich and poor

DOI10.1016/j.jcss.2003.10.005zbMath1076.68036OpenAlexW2146419039MaRDI QIDQ1880777

Sanjay Jain, Frank Stephan, Rolf Wiehagen, John Case

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)

Related Items (4)

Learning all subfunctions of a function ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Learning recursive functions: A survey ⋮ Robust separations in inductive inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• Some natural properties of strong-identification in inductive inference
• Robust learning aided by context
• Avoiding coding tricks by hyperrobust learning
• Robust behaviorally correct learning.
• Robust separations in inductive inference
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Ignoring data may be the only way to learn efficiently
• Inductive inference of recursive functions: Qualitative theory
• Inductive inference of recursive functions: Complexity bounds
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Robust learning is rich

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