Optimal Hardness Results for Maximizing Agreements with Monomials

Authors:
Vitaly Feldman
Affiliations:
Harvard University, USA
Venue:
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Year:
2006

Citing 0
Cited 2

Self-improved gaps almost everywhere for the agnostic approximation of monomials

Theoretical Computer Science
An Improved Branch-and-Bound Method for Maximum Monomial Agreement

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by learning of monomials in the agnostic framework of Haussler [12] and Kearns et al. [17]. Finding a monomial with the highest agreement rate was proved to be NP-hard by Kearns and Li [15].