3 search results - page 1 / 1 » Agnostic Learning of Monomials by Halfspaces Is Hard |
138
click to vote
FOCS
2009
IEEE
16 years 9 days ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
148
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
135
click to vote
COCO
2006
Springer
15 years 9 months ago
2006
Springer
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 le...