263 search results - page 7 / 53 » Splitting of Learnable Classes |
COCO
2001
Springer
13 years 12 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
JMLR
2007
13 years 7 months ago
2007
Gaussian kernels with flexible variances provide a rich family of Mercer kernels for learning algorithms. We show that the union of the unit balls of reproducing kernel Hilbert s...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
EUROCOLT
1997
Springer
13 years 11 months ago
1997
Springer
In any learnability setting, hypotheses are conjectured from some hypothesis space. Studied herein are the influence on learnability of the presence or absence of certain control ...