15 search results - page 1 / 3 » Learning DNF over the Uniform Distribution using a Quantum E... |
COLT
1995
Springer
13 years 9 months ago
1995
Springer
COLT
2001
Springer
13 years 10 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
FOCS
2009
IEEE
13 years 3 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...
FOCS
2003
IEEE
13 years 10 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...
COLT
2001
Springer
13 years 10 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...