PACS, simple-PAC and query learning

DOI10.1016/S0020-0190(99)00161-1MaRDI QIDQ294709zbMATH OpenOpenAlexFDO

Authors David Guijarro, Jorge 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

query learningtheory of computationKolmogorov complexityPAC learning

Mathematics Subject Classification ID

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

Recommendations

• PAC learning with simple examples
• PAC learning under helpful distributions
• Smart PAC-learners
• Smart PAC-learners
• PAC learning of probability distributions over a discrete domain.

Cites work

• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 1104346 (Why is no real title available?)
• scientific article; zbMATH DE number 1104347 (Why is no real title available?)
• A framework for polynomial-time query learnability
• A theory of the learnable
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Computational limitations on learning from examples
• Learning Boolean formulas
• Learning Simple Concepts under Simple Distributions
• Learning regular sets from queries and counterexamples
• PAC learning with simple examples
• Queries and concept learning
• Teaching a smarter learner.

Cited in

(6)

• scientific article; zbMATH DE number 1670724 (Why is no real title available?)
• Smart PAC-learners
• PAC learning with simple examples
• PAC learning under helpful distributions
• Simple PAC learning of simple decision lists
• PAC learning of probability distributions over a discrete domain.

This page was built for publication: PACS, simple-PAC and query learning

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