PAC Learning under Helpful Distributions

DOI10.1051/ita:2001112zbMath0992.68118OpenAlexW2089122628MaRDI QIDQ2771492

Rémi Gilleron, François Denis

Publication date: 14 February 2002

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_2_129_0

zbMATH Keywords

learnabilityPAC teaching model

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• PACS, simple-PAC and query learning
• Teachability in computational learning
• Teaching a smarter learner.
• Learning regular sets from queries and counterexamples
• Occam's razor
• Equivalence of models for polynomial learnability
• On the necessity of Occam algorithms
• Characteristic sets for polynomial grammatical inference
• On the complexity of teaching
• Lower bounds on learning decision lists and trees
• Exact learning Boolean functions via the monotone theory
• Probably Approximate Learning of Sets and Functions
• A theory of the learnable
• Learning Simple Concepts under Simple Distributions
• Complexity of automaton identification from given data
• PAC learning with simple examples
• Learning regular languages from simple positive examples