Ignoring data may be the only way to learn efficiently
From MaRDI portal
Recommendations
Cites work
- A formal theory of inductive inference. Part I
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Language identification in the limit
- Limiting recursion
- Nonmonotonic and inductive logic. 1st international workshop, Karlsruhe, Germany, December 4--7, 1990. Proceedings
- Polynomial-time inference of arbitrary pattern languages
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Toward a mathematical theory of inductive inference
Cited in
(25)- Learning efficiency of very simple grammars from positive data
- An average-case optimal one-variable pattern language learner
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Incremental concept learning for bounded data mining.
- Robust learning -- rich and poor
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Learning languages from positive data and a limited number of short counterexamples
- Inductive inference of approximations for recursive concepts
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Learning Efficiency of Very Simple Grammars from Positive Data
- Inferring descriptive generalisations of formal languages
- Set-driven and rearrangement-independent learning of recursive languages
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Co-learning of recursive languages from positive data
- Monotonic and dual monotonic language learning
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- A non-learnable class of E-pattern languages
- From learning in the limit to stochastic finite learning
- Learning recursive functions: A survey
- Quantum inductive inference by finite automata
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Learning indexed families of recursive languages from positive data: A survey
- Non-U-shaped vacillatory and team learning
- Consistent and coherent learning with \(\delta \)-delay
This page was built for publication: Ignoring data may be the only way to learn efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290134)
