587 search results - page 1 / 118 » On the Relative Sizes of Learnable Sets |
TCS
1998
13 years 5 months ago
1998
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
ECML
1993
Springer
13 years 9 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
ALT
2003
Springer
14 years 2 months ago
2003
Springer
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...