Maximizing agreements and coagnostic learning

DOI10.1016/J.TCS.2005.10.014MaRDI QIDQ817828zbMATHOpenAlexFDO

Authors Nader H. Bshouty, Lynn Burroughs

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.10.014

zbMATH Keywords

approximationPAC learningBoolean formulascoagnostic learningmaximum agreement

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1966608
• Maximizing agreements with one-sided error with applications to heuristic learning
• Maximizing agreements with one-sided error with applications to heuristic learning
• On the difficulty of approximately maximizing agreements.
• On agnostic learning of parities, monomials, and halfspaces

Cites work

• scientific article; zbMATH DE number 2089368 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263221 (Why is no real title available?)
• scientific article; zbMATH DE number 1559516 (Why is no real title available?)
• scientific article; zbMATH DE number 774007 (Why is no real title available?)
• A theory of the learnable
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Learnability and the Vapnik-Chervonenkis dimension
• Learning in the Presence of Malicious Errors
• Occam's razor
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Robust trainability of single neurons
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• Toward efficient agnostic learning

Cited in

(5)

• Self-improved gaps almost everywhere for the agnostic approximation of monomials
• Maximizing agreements with one-sided error with applications to heuristic learning
• An improved branch-and-bound method for maximum monomial agreement
• scientific article; zbMATH DE number 1966608 (Why is no real title available?)
• Maximizing agreements with one-sided error with applications to heuristic learning

This page was built for publication: Maximizing agreements and coagnostic learning

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