Convergence rates of active learning for maximum likelihood estimation

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 1090-1098

  Chaudhuri, Kamalika ^a   Kakade, Sham M ^b   Netrapalli, Praneeth ^c   Sanghavi, Sujay ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

^d UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BINS; INFORMATION SCIENCE; LEARNING ALGORITHMS; MAXIMUM LIKELIHOOD;

ACTIVE-LEARNING ALGORITHM; BINARY CLASSIFICATION; CONDITIONAL RANDOM FIELD; GENERALIZED LINEAR MODEL; LOGISTIC REGRESSIONS; LOWER ORDER TERMS; MULTI-CLASS CLASSIFICATION; NEAR-OPTIMAL PERFORMANCE;

MAXIMUM LIKELIHOOD ESTIMATION;

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

References (22)

1. A. Agarwal. Selective sampling algorithms for cost-sensitive multiclass prediction. In Proceedings of the 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, USA, 16-21 June 2013, pages 1220-1228, 2013.
2. M.-F. Balcan, A. Beygelzimer, and J. Langford. Agnostic active learning. J. Comput. Syst. Sci., 75(1):78-89, 2009.
3. M.-F. Balcan and P. M. Long. Active and passive learning of linear separators under logconcave distributions. In COLT, 2013.
4. A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang. Agnostic active learning without constraints. In NIPS, 2010.
5. L. Cam and G. Yang. Asymptotics in Statistics: Some Basic Concepts. Springer Series in Statistics. Springer New York, 2000.
6. J. Cornell. Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data (third ed.). Wiley, 2002.
7. S. Dasgupta. Coarse sample complexity bounds for active learning. In NIPS, 2005.
8. S. Dasgupta. Two faces of active learning. Theor. Comput. Sci., 412(19), 2011.
9. S. Dasgupta and D. Hsu. Hierarchical sampling for active learning. In ICML, 2008.
10. S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. In NIPS, 2007.
11. R. Frostig, R. Ge, S. M. Kakade, and A. Sidford. Competing with the empirical risk minimizer in a single pass. arXiv preprint arXiv:1412.6606, 2014.
12. Q. Gu, T. Zhang, C. Ding, and J. Han. Selective labeling via error bound minimization. In In Proc. of Advances in Neural Information Processing Systems (NIPS) 25, Lake Tahoe, Nevada, United States, 2012.
13. Q. Gu, T. Zhang, and J. Han. Batch-mode active learning via error bound minimization. In 30th Conference on Uncertainty in Artificial Intelligence (UAI), 2014.
14. S. Hanneke. A bound on the label complexity of agnostic active learning. In ICML, 2007.
15. M. Kääriäinen. Active learning in the non-realizable case. In ALT, 2006.
16. L. Le Cam. Asymptotic Methods in Statistical Decision Theory. Springer, 1986.
17. E. L. Lehmann and G. Casella. Theory of point estimation, volume 31. Springer Science & Business Media, 1998.
18. R. D. Nowak. The geometry of generalized binary search. IEEE Transactions on Information Theory, 57(12):7893-7906, 2011.
19. S. Sabato and R. Munos. Active regression through stratification. In NIPS, 2014.
20. R. Urner, S. Wulff, and S. Ben-David. Plal: Cluster-based active learning. In COLT, 2013.
21. A. W. van der Vaart. Asymptotic Statistics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2000.
22. C. Zhang and K. Chaudhuri. Beyond disagreement-based agnostic active learning. In Proc. of Neural Information Processing Systems, 2014.