article · 2008

Coarse Sample Complexity Bounds for Active

Learning Sanjoy Dasgupta, Sanjoy Dasgupta

Cited by 0Abstract and details only

Abstract

We characterize the sample complexity of active learning problems in terms of a parameter which takes into account the distribution over the input space, the specific target hypothesis, and the desired accuracy.

Cite this paper

APA 7

Dasgupta, L. S., & Dasgupta, S. (2008). Coarse Sample Complexity Bounds for Active.

MLA 9

Dasgupta, Learning Sanjoy, and Sanjoy Dasgupta. “Coarse Sample Complexity Bounds for Active.” 2008.

Chicago

Dasgupta, Learning Sanjoy, and Sanjoy Dasgupta. 2008. “Coarse Sample Complexity Bounds for Active.”

Harvard

Dasgupta, L.S. and Dasgupta, S. (2008) ‘Coarse Sample Complexity Bounds for Active’.

BibTeX

@article{dasgupta2008coarse,
  title = {{Coarse Sample Complexity Bounds for Active}},
  author = {Dasgupta, Learning Sanjoy and Dasgupta, Sanjoy},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.