PACS, simple-PAC and query learning

DOI10.1016/S0020-0190(99)00161-1zbMath1339.68130OpenAlexW2090291658MaRDI QIDQ294709

David Guijarro, Jorge E. Castro

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099001611?np=y

zbMATH Keywords

Kolmogorov complexityPAC learningtheory of computationquery learning

Mathematics Subject Classification ID

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

Related Items

PAC Learning under Helpful Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teaching a smarter learner.
• Learning regular sets from queries and counterexamples
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Queries and concept learning
• A theory of the learnable
• Computational limitations on learning from examples
• Learning Simple Concepts under Simple Distributions
• A framework for polynomial-time query learnability
• Learning Boolean formulas
• PAC learning with simple examples