Exploring learnability between exact and PAC

DOI10.1016/j.jcss.2004.10.002zbMath1101.68750OpenAlexW2071152187MaRDI QIDQ1780447

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

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 theoryMachine learningExact learningParallel learningProbably approximately correct learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Unnamed Item ⋮ Parameterized learnability of juntas

Cites Work

• Unnamed Item
• Exact learning of formulas in parallel
• Occam's razor
• On the computational power of depth-2 circuits with threshold and modulo gates
• Queries and concept learning
• Constant depth circuits, Fourier transform, and learnability
• A theory of the learnable
• Learning regular languages from simple positive examples

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