Exploring learnability between exact and PAC

DOI10.1016/J.JCSS.2004.10.002MaRDI QIDQ1780447zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty, Jeffrey Jackson, C. Tamon

Publication date 13 June 2005

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2004.10.002

zbMATH Keywords

Computational learning theoryExact learningMachine learningParallel learningProbably approximately correct learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2089366
• Learning Theory
• Publication:4714286
• Some contributions to fixed-distribution learning theory
• How many queries are needed to learn?

Cites work

• A theory of the learnable
• Constant depth circuits, Fourier transform, and learnability
• Exact learning of formulas in parallel
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• Learning regular languages from simple positive examples
• Occam's razor
• On the computational power of depth-2 circuits with threshold and modulo gates
• Queries and concept learning

Cited in

(9)

• Parameterized learnability of juntas
• Counting extensional differences in BC-learning
• Can PAC learning algorithms tolerate random attribute noise?
• scientific article; zbMATH DE number 2089366 (Why is no real title available?)
• PAC learning with simple examples
• Learning Theory
• Learnability of solutions to conjunctive queries
• PAC-learning with approximate predictors
• Actively learning from machine learning models with queries and counterexamples

This page was built for publication: Exploring learnability between exact and PAC

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