73 search results - page 5 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
SIAMCOMP
1998
13 years 7 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
ECML
2003
Springer
14 years 23 days ago
2003
Springer
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
NIPS
2007
13 years 9 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...