Sciweavers

29 search results - page 1 / 6
» Learning Random Monotone DNF Under the Uniform Distribution
Sort
View
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
13 years 10 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
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 ...
Jeffrey C. Jackson, Rocco A. Servedio
COLT
2008
Springer
13 years 6 months ago
Learning Random Monotone DNF Under the Uniform Distribution
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...
Linda Sellie
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 6 months ago
Learning Random Monotone DNF
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...
COLT
2001
Springer
13 years 9 months ago
On Learning Monotone DNF under Product Distributions
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...
Rocco A. Servedio
COLT
2010
Springer
13 years 2 months ago
Mansour's Conjecture is True for Random DNF Formulas
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)...
Adam R. Klivans, Homin K. Lee, Andrew Wan