scientific article; zbMATH DE number 1256729

MaRDI QIDQ4228464zbMATH OpenFDO

Authors Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon

Publication date 1 March 1999

zbMATH Keywords

learning algorithmPAC learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Sample-efficient strategies for learning in the presence of noise
• PAC learning with nasty noise.
• scientific article; zbMATH DE number 1453040
• On-line learning with malicious noise and the closure algorithm

Cited in

(15)

• Learning with restricted focus of attention
• On-line learning with malicious noise and the closure algorithm
• PAC learning with nasty noise.
• Improved lower bounds for learning from noisy examples: An information-theoretic approach
• On the robustness of learning parity with noise
• PAC-learning in the presence of one-sided classification~noise
• Learning juntas in the presence of noise
• scientific article; zbMATH DE number 6612702 (Why is no real title available?)
• Learning in the Presence of Malicious Errors
• Sample-efficient strategies for learning in the presence of noise
• scientific article; zbMATH DE number 4166882 (Why is no real title available?)
• 10.1162/153244304773936072
• scientific article; zbMATH DE number 1453040 (Why is no real title available?)
• Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
• Theory and Applications of Models of Computation

This page was built for publication:

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