The true sample complexity of active learning

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 45-56

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

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; LINEAR SEPARATORS; LOWER BOUNDS; NON-HOMOGENEOUS; NUMBER OF SAMPLES; SAMPLE COMPLEXITY;

DECISION TREES;

EID: 84860640656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Antos and G Lugosi. Strong minimax lower bounds for learning. Machine Learning, 30: 31-56, 1998.
2. M.-F Balcan, A. Beygelzimer, and J. Langford. Agnostic active learning. In Proceedings of the 23rd International Conference on Machine Learning, 2006.
3. M.-F. Balcan and A. Blum. A PAC-style model for learning from labeled and unlabeled data. Book chapter in "Semi-Supervised Learning", O. Chapelle and B. Schlkopf and A. Zien, eds., MIT press, 2006.
4. M.-F. Balcan, A. Broder, and T. Zhang. Margin based active learning. InProceedings of the 20th Annual Conference on Learning Theory, 2007.
5. R. Castro and R. Nowak. Minimax bounds for active learning. InProceedings of the 20th Annual Conference on Learning Theory, 2007.
6. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15(2): 201-221, 1994.
7. S. Dasgupta. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems, 2004.
8. S. Dasgupta. Coarse sample complexity bounds for active learning. In Advances in Neural Information Processing Systems, 2005.
9. S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. InAdvances in Neural Information Processing Systems, 2007.
10. S. Dasgupta, A. Kalai, and C. Monteleoni. Analysis of perceptron-based active learning. InProceedings of the 18th Annual Conference on Learning Theory, 2005.
11. L. Devroye, L. Gyorfi, and G Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
12. S. Hanneke. A bound on the label complexity of agnostic active learning. InProceedings of the 24th International Conference on Machine Learning, 2007.
13. S. Hanneke. Teaching dimension and the complexity of active learning. InProceedings of the 20th Conference on Learning Theory, 2007.
14. D. Haussler, N. Littlestone, and M. Warmuth Predicting {0, 1}-functions on randomly drawn points. Information and Computation, 115: 248-292, 1994.
15. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5): 1926-1940, 1998.
16. V N. Vapnik. Statistical Learning Theory. John Wiley and Sons Inc., 1998.