On approximately identifying concept classes in the limit
From MaRDI portal
Publication:6061901
DOI10.1007/3-540-60454-5_47zbMath1527.68107MaRDI QIDQ6061901
Takashi Yokomori, Satoshi Kobayashi
Publication date: 8 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning elementary formal systems
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Toward efficient agnostic learning
- The theory of well-quasi-ordering: a frequently discovered concept
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
- Theory of Formal Systems. (AM-47)
- A theory of the learnable
- Computational limitations on learning from examples
- Inductive inference of formal languages from positive data
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- On free monoids partially ordered by embedding
- Language identification in the limit
