136 search results - page 9 / 28 » On Learning Monotone Boolean Functions |
AUTOMATICA
2005
13 years 7 months ago
2005
In iterative learning control schemes for linear discrete time systems, conditions to guarantee the monotonic convergence of the tracking9 error norms are derived. By using the Ma...
ICALP
2001
Springer
14 years 3 days ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
COLT
2001
Springer
14 years 4 days 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...
NIPS
2001
13 years 9 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...