46 search results - page 1 / 10 » The True Sample Complexity of Active Learning |
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
JMLR
2010
12 years 11 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...