113 search results - page 1 / 23 » Optimal Hardness Results for Maximizing Agreements with Mono... |
79
Voted
COCO
2006
Springer
15 years 3 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...
FOCS
2009
IEEE
15 years 6 months 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...
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...