Robust learning is rich
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4055080 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 67627 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3421944 (Why is no real title available?)
- scientific article; zbMATH DE number 3071015 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Aggregating inductive expertise
- Avoiding coding tricks by hyperrobust learning
- Comparison of identification criteria for machine inductive inference
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- Probability and plurality for aggregations of learning machines
- Research in the theory of inductive inference by GDR mathematicians - A survey
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Transformations that preserve learnability
Cited in
(11)- Robust learning of automatic classes of languages
- Robust learning of automatic classes of languages
- Learning all subfunctions of a function
- Robust logics
- Avoiding coding tricks by hyperrobust learning
- Robust learning -- rich and poor
- Learning recursive functions: A survey
- 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.
This page was built for publication: Robust learning is rich
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943125)