462 search results - page 1 / 93 » Learning DNF by Decision Trees |
ALT
2010
Springer
15 years 1 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
78
Voted
IJCAI
1989
15 years 1 months ago
1989
101
click to vote
STOC
1994
ACM
15 years 4 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...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
FOCS
2009
IEEE
14 years 10 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...