file.pdf (118.86 kB)
Download file

The Sample Complexity of Self-Verifying Bayesian Active Learning

Download (118.86 kB)
journal contribution
posted on 01.04.2011, 00:00 by Liu Yang, Steve Hanneke, Jaime G. Carbonell

We prove that access to a prior distribution over target functions can dramatically improve the sample complexity of self-terminating active learning algorithms, so that it is always better than the known results for prior-dependent passive learning. In particular, this is in stark contrast to the analysis of prior-independent algorithms, where there are simple known learning problems for which no self-terminating algorithm can provide this guarantee for all priors

History

Publisher Statement

Copyright 2011 by the authors.

Date

01/04/2011

Usage metrics

Exports