The true sample complexity of active learning

Machine Learning

Volumn 80, Issue 2-3, 2010, Pages 111-139

  Balcan, Maria Florina ^a   Hanneke, Steve ^b   Vaughan, Jennifer Wortman ^c  

^a Georgia Institute of Technology   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Active learning; Classification; Learning theory; Sample complexity; Selective sampling; Sequential design

Indexed keywords

ACTIVE LEARNING; CLASSIFICATION; LEARNING THEORY; SAMPLE COMPLEXITY; SELECTIVE SAMPLING; SEQUENTIAL DESIGN;

DECISION TREES;

EID: 77955659703     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-010-5174-y     Document Type: Article

References (21)

1. A. Antos G. Lugosi 1998 Strong minimax lower bounds for learning Machine Learning 30 31 56 10.1023/A:1007454427662
2. Balcan, M.-F., & Blum, A. (2006). A PAC-style model for learning from labeled and unlabeled data. In O. Chapelle, B. Schölkopf, & A. Zien (Eds.), Semi-supervised learning. Cambridge: MIT.
3. Balcan, M.-F., Beygelzimer, A., & Langford, J. (2006). Agnostic active learning. In Proceedings of the 23rd international conference on machine learning.
4. Balcan, M.-F., Broder, A., & Zhang, T. (2007). Margin based active learning. In Proceedings of the 20th annual conference on learning theory.
5. Balcan, M.-F., Hanneke, S., & Wortman, J. (2008). The true sample complexity of active learning. In Proceedings of the 21st annual conference on learning theory.
6. A. Blumer A. Ehrenfeucht D. Haussler M. K. Warmuth 1989 Learnability and the Vapnik Chervonenkis dimension Journal of the ACM 36 4 929 965 0697.68079 10.1145/76359.76371 1072253 (Pubitemid 20613338)
7. Castro, R., & Nowak, R. (2007). Minimax bounds for active learning. In Proceedings of the 20th annual conference on learning theory.
8. D. Cohn L. Atlas R. Ladner 1994 Improving generalization with active learning Machine Learning 15 2 201 221
9. Dasgupta, S. (2004). Analysis of a greedy active learning strategy. In Advances in neural information processing systems.
10. Dasgupta, S. (2005). Coarse sample complexity bounds for active learning. In Advances in neural information processing systems.
11. Dasgupta, S., Kalai, A., & Monteleoni, C. (2005). Analysis of perceptron-based active learning. In Proceedings of the 18th annual conference on learning theory.
12. Dasgupta, S., Hsu, D., & Monteleoni, C. (2007). A general agnostic active learning algorithm. In Advances in neural information processing systems.
13. Devroye, L., Gyorfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. Berlin: Springer.
14. Y. Freund H. S. Seung E. Shamir N. Tishby 1997 Selective sampling using the query by committee algorithm Machine Learning 28 23 133 168 0881.68093 10.1023/A:1007330508534
15. Hanneke, S. (2007a). A bound on the label complexity of agnostic active learning. In Proceedings of the 24th international conference on machine learning.
16. Hanneke, S. (2007b). Teaching dimension and the complexity of active learning. In Proceedings of the 20th conference on learning theory.
17. Hanneke, S. (2009). Theoretical foundations of active learning. PhD thesis, Machine Learning Department, Carnegie Mellon University.
18. D. Haussler N. Littlestone M. Warmuth 1994 Predicting {0,1}-functions on randomly drawn points Information and Computation 115 248 292 0938.68785 10.1006/inco.1994.1097 1304811
19. J. Shawe-Taylor P. L. Bartlett R. C. Williamson M. Anthony 1998 Structural risk minimization over data-dependent hierarchies IEEE Transactions on Information Theory 44 5 1926-1940 10.1109/18.705570 1664055
20. Vapnik, V. (1982). Estimation of dependencies based on empirical data. New York: Springer.
21. Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley.