PACS, simple-PAC and query learning
From MaRDI portal
Publication:294709
DOI10.1016/S0020-0190(99)00161-1zbMATH Open1339.68130OpenAlexW2090291658MaRDI QIDQ294709FDOQ294709
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
Recommendations
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Learning regular sets from queries and counterexamples
- Queries and concept learning
- A theory of the learnable
- Title not available (Why is that?)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Computational limitations on learning from examples
- Learning Simple Concepts under Simple Distributions
- A framework for polynomial-time query learnability
- Learning Boolean formulas
- Title not available (Why is that?)
- Title not available (Why is that?)
- PAC learning with simple examples
- Teaching a smarter learner.
Cited In (5)
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)