43 search results - page 4 / 9 » Hardness of Learning Halfspaces with Noise |
FOCS
2008
IEEE
14 years 6 days ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
FOCS
2008
IEEE
14 years 6 days ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
TNN
2008
13 years 5 months ago
2008
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
Training datasets for learning of object categories are often contaminated or imperfect. We explore an approach to automatically identify examples that are noisy or troublesome fo...