50 search results - page 5 / 10 » On Learning Monotone DNF under Product Distributions |
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
ALT
1998
Springer
13 years 11 months ago
1998
Springer
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
COLT
2003
Springer
14 years 18 days ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...