Maximizing agreements and coagnostic learning

DOI10.1016/j.tcs.2005.10.014zbMath1086.68062OpenAlexW2124856856MaRDI QIDQ817828

Lynn Burroughs, Nader H. Bshouty

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

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

Related Items (2)

Self-improved gaps almost everywhere for the agnostic approximation of monomials ⋮ An Improved Branch-and-Bound Method for Maximum Monomial Agreement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occam's razor
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Toward efficient agnostic learning
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• Robust trainability of single neurons
• Learning in the Presence of Malicious Errors
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

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