49 search results - page 2 / 10 » Learning DNF from Random Walks |
COLT
2001
Springer
13 years 9 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...
ALT
2006
Springer
14 years 2 months ago
2006
Springer
AIPS
2004
13 years 6 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
DAGM
2004
Springer
13 years 10 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
STOC
1993
ACM
13 years 9 months ago
1993
ACM