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 required to achieve a specified expected risk. Key words: Active Learning, Bayesian Learning, Sample Complexity, Information Theory
Liu Yang, Steve Hanneke, Jaime G. Carbonell