29 search results - page 2 / 6 » Learning Random Monotone DNF Under the Uniform Distribution |
FOCS
2006
IEEE
13 years 11 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...
ALT
2011
Springer
12 years 4 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
FOCS
2009
IEEE
13 years 2 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...