46 search results - page 2 / 10 » The True Sample Complexity of Active Learning |
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
NIPS
2007
13 years 8 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...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
COLING
2010
13 years 2 months ago
2010
Active Learning (AL) is a selective sampling strategy which has been shown to be particularly cost-efficient by drastically reducing the amount of training data to be manually ann...