Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

COLT
2008
Springer

favoriteEmaildiscussreport

118views Machine Learning» more COLT 2008»

Learning Random Monotone DNF Under the Uniform Distribution

13 years 11 months ago

Learning Random Monotone DNF Under the Uniform Distribution

Download colt2008.cs.helsinki.fi

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 uniform distribution. To prove this we identify the class of well behaved monotone c log(n)-DNF formulae, and show that almost every monotone DNF formula is well-behaved, and that there exists a probabilistic Turing machine that exactly learns all well behaved monotone c log(n)-DNF formula.

Linda Sellie

Real-time Traffic

COLT 2008 | Machine Learning | Monotone Dnf Formula | Probabilistic Polynomial Time | Probabilistic Turing Machine |

claim paper

Related Content

» On Learning Random DNF Formulas Under the Uniform Distribution

» Learning Random Monotone DNF

» On Learning Monotone DNF under Product Distributions

» Mansours Conjecture is True for Random DNF Formulas

» New Results for Learning Noisy Parities and Halfspaces

» On NoiseTolerant Learning of Sparse Parities and Related Problems

» Weakly learning DNF and characterizing statistical query learning using Fourier analysis

» Learning Random LogDepth Decision Trees under the Uniform Distribution

» Learning and Smoothed Analysis

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COLT
Authors	Linda Sellie

Comments (0)