A bound on the label complexity of agnostic active learning
Lists
Only you see this
Abstract
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algorithm proposed by Balcan, Beygelzimer & Langford (Balcan et al., 2006). This represents the first nontrivial general-purpose upper bound on label complexity in the agnostic PAC model.
BibTeX
@inproceedings{hanneke2007bound,
author = {Steve Hanneke},
title = {{A bound on the label complexity of agnostic active learning}},
booktitle = {International Conference on Machine Learning},
year = {2007},
url = {https://openreview.net/forum?id=S1bSziWubr},
}Loading related content...