Recommendations
Cites work
- A Bayesian/information theoretic model of learning to learn via multiple task sampling
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Extremes in the degrees of inferability
- Gödel numberings of partial recursive functions
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Inclusion problems in parallel learning and games
- Learning with the knowledge of an upper bound on program size
- On learning multiple concepts in parallel
- On the role of procrastination in machine learning
- On the structure of degrees of inferability.
- Toward a mathematical theory of inductive inference
- Training sequences
Cited in
(12)- Inductive transfer with context-sensitive neural networks
- Avoiding coding tricks by hyperrobust learning
- Learning classes of approximations to non-recursive functions.
- Robust learning -- rich and poor
- Robust separations in inductive inference
- scientific article; zbMATH DE number 1804101 (Why is no real title available?)
- scientific article; zbMATH DE number 1552267 (Why is no real title available?)
- scientific article; zbMATH DE number 1755774 (Why is no real title available?)
- scientific article; zbMATH DE number 1756687 (Why is no real title available?)
- Modeling and Using Context
- Learning all subfunctions of a function
- Learning recursive functions: A survey
This page was built for publication: Robust learning aided by context
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567396)
