Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
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...
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...