9 search results - page 1 / 2 » Uniform Characterizations of Polynomial-Query Learnabilities |
DIS
1998
Springer
13 years 9 months ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
JMLR
2010
12 years 11 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
ALT
2002
Springer
14 years 1 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...