PAC learning under helpful distributions

DOI10.1051/ITA:2001112MaRDI QIDQ2771492zbMATH OpenOpenAlexFDO

Authors François Denis, Rémi Gilleron

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, https://eudml.org/doc/222076, https://semanticscholar.org/paper/a5950643eeeb7acc2d0e170f5ad9c3af8b344f3d

zbMATH Keywords

learnabilityPAC teaching model

Mathematics Subject Classification ID

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

Recommendations

• PAC learning under helpful distributions
• On the relationship between models for learning in helpful environments
• PAC learning with simple examples
• scientific article; zbMATH DE number 67636
• PAC learning from positive statistical queries

Cites work

• A theory of the learnable
• An introduction to Kolmogorov complexity and its applications. 2nd ed
• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Equivalence of models for polynomial learnability
• Exact learning Boolean functions via the monotone theory
• scientific article; zbMATH DE number 4060753 (Why is no real title available?)
• scientific article; zbMATH DE number 67633 (Why is no real title available?)
• scientific article; zbMATH DE number 67797 (Why is no real title available?)
• Learning DFA from simple examples
• Learning regular languages from simple positive examples
• Learning regular sets from queries and counterexamples
• Learning Simple Concepts under Simple Distributions
• Lower bounds on learning decision lists and trees
• Occam's razor
• On the complexity of teaching
• On the necessity of Occam algorithms
• On the relationship between models for learning in helpful environments
• PAC learning under helpful distributions
• PAC learning with simple examples
• PACS, simple-PAC and query learning
• Probably Approximate Learning of Sets and Functions
• Teachability in computational learning
• Teaching a smarter learner.

Cited in

(12)

• PAC learning of probability distributions over a discrete domain.
• On the relationship between models for learning in helpful environments
• PACS, simple-PAC and query learning
• Smart PAC-learners
• scientific article; zbMATH DE number 67636 (Why is no real title available?)
• scientific article; zbMATH DE number 67797 (Why is no real title available?)
• PAC learning from positive statistical queries
• Partial Occam's razor and its applications
• PAC learning under helpful distributions
• Simple PAC learning of simple decision lists
• PAC-learning with approximate predictors
• Theoretical computer science: computational complexity

This page was built for publication: PAC learning under helpful distributions

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