Maximizing agreements and coagnostic learning

DOI10.1016/J.TCS.2005.10.014zbMATH Open1086.68062OpenAlexW2124856856MaRDI QIDQ817828FDOQ817828

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

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

zbMATH Keywords

approximationPAC learningBoolean formulascoagnostic learningmaximum agreement

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• An improved branch-and-bound method for maximum monomial agreement
• Self-improved gaps almost everywhere for the agnostic approximation of monomials
• Maximizing agreements with one-sided error with applications to heuristic learning
• Maximizing agreements with one-sided error with applications to heuristic learning
• Title not available (Why is that?)

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)