Robust learning is rich
From MaRDI portal
Publication:5943125
DOI10.1006/jcss.2000.1700zbMath0992.68176OpenAlexW2076572906MaRDI QIDQ5943125
Sanjay Jain, Carl H. Smith, Rolf Wiehagen
Publication date: 9 September 2001
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bc8551d1fa34922fa497e58071ea85950f52fbe3
Related Items
Robust learning -- rich and poor ⋮ Robust learning of automatic classes of languages ⋮ Learning all subfunctions of a function ⋮ Learning recursive functions: A survey ⋮ Robust separations in inductive inference ⋮ Learning classes of approximations to non-recursive functions.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Probability and plurality for aggregations of learning machines
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Avoiding coding tricks by hyperrobust learning
- Transformations that preserve learnability
- Aggregating inductive expertise
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Inductive inference of recursive functions: Qualitative theory
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit