Learning Theory

DOI10.1007/B98522MaRDI QIDQ4680916zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The one-inclusion graph algorithm is near-optimal for the prediction model of learning
• Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
• The weighted majority algorithm
• Learning parities in the mistake-bound model
• PAC learning of probability distributions over a discrete domain.

Cited in

(2)

• Algorithmic complexity bounds on future prediction errors
• Algorithmic Learning Theory

This page was built for publication: Learning Theory

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