A Bound on the Label Complexity of Agnostic Active Learning

Hanneke, Steve

doi:10.1145/1273496.1273541

A Bound on the Label Complexity of Agnostic Active Learning

Steve Hanneke

ICML 2007 pp. 353-360

doi:10.1145/1273496.1273541 /icml/2007/hanneke2007icml-bound/

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.

PDF ICML Semantic Scholar

Cite

Text

Hanneke. "A Bound on the Label Complexity of Agnostic Active Learning." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273541

Markdown

[Hanneke. "A Bound on the Label Complexity of Agnostic Active Learning." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/hanneke2007icml-bound/) doi:10.1145/1273496.1273541

BibTeX

@inproceedings{hanneke2007icml-bound,
  title     = {{A Bound on the Label Complexity of Agnostic Active Learning}},
  author    = {Hanneke, Steve},
  booktitle = {International Conference on Machine Learning},
  year      = {2007},
  pages     = {353-360},
  doi       = {10.1145/1273496.1273541},
  url       = {https://mlanthology.org/icml/2007/hanneke2007icml-bound/}
}