Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TERM:
Reports tagged with term:
TR06-032 | 25th February 2006
Vitaly Feldman

#### Optimal Hardness Results for Maximizing Agreements with Monomials

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 originates in learning and is referred to as {\em agnostic learning} of monomials. Finding a monomial with the highest agreement rate was ... more >>>

ISSN 1433-8092 | Imprint