Robust separations in inductive inference
From MaRDI portal
Recommendations
- Robust probabilistic inference
- Abductively robust inference
- Topological separations in inductive inference
- Topological separations in inductive inference
- Inductive Inference and Partition Exchangeability in Classification
- scientific article; zbMATH DE number 3962953
- Robust inference
- Isoseparation and robustness in parametric Bayesian inference
- scientific article; zbMATH DE number 7014202
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Approximate inference and scientific method
- Avoiding coding tricks by hyperrobust learning
- Comparison of identification criteria for machine inductive inference
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Language identification in the limit
- Prudence and other conditions on formal language learning
- Robust behaviorally correct learning.
- Robust learning -- rich and poor
- Robust learning aided by context
- Robust learning is rich
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Toward a mathematical theory of inductive inference
Cited in
(13)- Qualitative robustness in abstract inference
- Maximal machine learnable classes
- Avoiding coding tricks by hyperrobust learning
- Learning classes of approximations to non-recursive functions.
- Robust behaviorally correct learning.
- Robust learning -- rich and poor
- Robust learning of automatic classes of languages
- Topological separations in inductive inference
- Inductive Inference and Partition Exchangeability in Classification
- Computability-theoretic learning complexity
- Synthesizing noise-tolerant language learners
- Learning all subfunctions of a function
- Topological separations in inductive inference
This page was built for publication: Robust separations in inductive inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011108)
