The sample complexity of self-verifying Bayesian active learning

Journal of Machine Learning Research

Volumn 15, Issue , 2011, Pages 816-822

  Yang, Liu ^a   Hanneke, Steve ^b   Carbonell, Jaime ^a  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; ACTIVE-LEARNING ALGORITHM; LEARNING PROBLEM; PASSIVE LEARNING; PRIOR DISTRIBUTION; SAMPLE COMPLEXITY; TARGET FUNCTIONS;

LEARNING ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 84862296539     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (21)

1. R. B. Ash and C. A. Doléans-Dade. Probability & Measure Theory. Academic Press, 2000.
2. M.-F. Balcan, A. Beygelzimer, and J. Langford. Agnostic active learning. Journal of Computer and System Sciences, 75(1):78-89, 2009.
3. M.-F. Balcan, A. Broder, and T. Zhang. Margin based active learning. In Proceedings of the 20th Conference on Learning Theory, 2007.
4. A. Beygelzimer, S. Dasgupta, and J. Langford. Importance weighted active learning. In Proceedings of the International Conference on Machine Learning, 2009.
5. M.-F. Balcan, S. Hanneke, and J. Wortman Vaughan. The true sample complexity of active learning. Machine Learning, 80(2-3):111-139, September 2010.
6. R. Castro and R. Nowak. Minimax bounds for active learning. IEEE Transactions on Information Theory, 54(5):2339-2353, July 2008.
7. S. Dasgupta. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems, pages 337-344.MIT Press, 2004.
8. S. Dasgupta. Coarse sample complexity bounds for active learning. In Proc. of Neural Information Processing Systems (NIPS), 2005.
9. S. Dasgupta, D. Hsu, and C.Monteleoni. A general agnostic active learning algorithm. In Advances in Neural Information Processing Systems 20, 2007.
10. S. Dasgupta, A. T. Kalai, and C. Monteleoni. Analysis of perceptron-based active learning. Journal of Machine Learning Research, 10:281-299, 2009.
11. E. Friedman. Active learning for smooth problems. In Proceedings of the 22nd Conference on Learning Theory, 2009.
12. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. In Machine Learning, pages 133-168, 1997.
13. S. Hanneke. A bound on the label complexity of agnostic active learning. In Proc. of the 24th International Conference onMachine Learning, 2007.
14. S. Hanneke. Teaching dimension and the complexity of active learning. In Proc. of the 20th Annual Conference on Learning Theory (COLT), 2007.
15. S. Hanneke. Theoretical Foundations of Active Learning. PhD thesis, Carnegie Mellon University, 2009.
16. S. Hanneke. Rates of convergence in active learning. The Annals of Statistics, 39(1):333-361, 2011.
17. D. Haussler, M. Kearns, and R. Schapire. Bounds on the sample complexity of bayesian learning using information theory and the vc dimension. In Machine Learning, pages 61-74. Morgan Kaufmann, 1992.
18. M. Kääriäinen. Active learning in the nonrealizable case. In Proc. of the 17th International Conference on Algorithmic Learning Theory, 2006.
19. V. Koltchinskii. Rademacher complexities and bounding the excess risk in active learning. Journal of Machine Learning Research, To Appear, 2010.
20. R. D. Nowak. Generalized binary search. In Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing, 2008.
21. L. Wang. Sufficient conditions for agnostic active learnable. In Advances in Neural Information Processing Systems 22, 2009.