On approximately identifying concept classes in the limit

DOI10.1007/3-540-60454-5_47MaRDI QIDQ6061901zbMATH OpenFDO

Authors Satoshi Kobayashi, Takashi Yokomori

Publication date 8 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60454-5_47

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1836430
• scientific article; zbMATH DE number 193511
• Probably Approximate Learning of Sets and Functions
• Learning approximately regular languages with reversible languages
• A note on polynomial-time learnability in the limit from positive data

Cites work

• A theory of the learnable
• Computational limitations on learning from examples
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• scientific article; zbMATH DE number 996380 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 1351096 (Why is no real title available?)
• scientific article; zbMATH DE number 1351108 (Why is no real title available?)
• scientific article; zbMATH DE number 2077180 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning elementary formal systems
• On free monoids partially ordered by embedding
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• The theory of well-quasi-ordering: a frequently discovered concept
• Theory of Formal Systems. (AM-47)
• Toward efficient agnostic learning
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(4)

• scientific article; zbMATH DE number 1966536 (Why is no real title available?)
• Learning Theory
• Upper Bound for the Number of Concepts of Contranominal-Scale Free Contexts
• \(k\)-Fold unions of low-dimensional concept classes

This page was built for publication: On approximately identifying concept classes in the limit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061901)