Active learning by learning

作者: Wei-Ning Hsu , Hsuan-Tien Lin

DOI:

关键词:

摘要: Pool-based active learning is an important technique that helps reduce labeling efforts within a pool of unlabeled instances. Currently, most pool-based strategies are constructed based on some human-designed philosophy; is, they reflect what human beings assume to be "good questions." However, while such philosophies can useful specific data sets, it often difficult establish the theoretical connection those true performance interest. In addition, given single philosophy unlikely work all scenarios, choosing and blending under different scenarios but challenging practical task. This paper tackles this task by letting machines adaptively "learn" from set particular set. More specifically, we design algorithm connects with well-known multi-armed bandit problem. Further, postulate that, appropriate choice for learner, possible estimate fly. Extensive empirical studies resulting ALBL confirm performs better than state-of-the-art leading learning, which philosophy.

参考文章(21)
Joannès Vermorel, Mehryar Mohri, Multi-armed Bandit Algorithms and Empirical Evaluation Machine Learning: ECML 2005. pp. 437- 448 ,(2005) , 10.1007/11564096_42
Pinar Donmez, Jaime G. Carbonell, Paired-Sampling in Density-Sensitive Active Learning ISAIM. ,(2008)
Pinar Donmez, Jaime G. Carbonell, Paul N. Bennett, Dual Strategy Active Learning european conference on machine learning. pp. 116- 127 ,(2007) , 10.1007/978-3-540-74958-5_14
Hieu T. Nguyen, Arnold Smeulders, Active learning using pre-clustering international conference on machine learning. pp. 79- ,(2004) , 10.1145/1015330.1015349
Herbert Robbins, Some aspects of the sequential design of experiments Bulletin of the American Mathematical Society. ,vol. 58, pp. 527- 535 ,(1952) , 10.1090/S0002-9904-1952-09620-8
Sanjoy Dasgupta, Daniel Hsu, Hierarchical sampling for active learning Proceedings of the 25th international conference on Machine learning - ICML '08. pp. 208- 215 ,(2008) , 10.1145/1390156.1390183
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire, The Nonstochastic Multiarmed Bandit Problem SIAM Journal on Computing. ,vol. 32, pp. 48- 77 ,(2003) , 10.1137/S0097539701398375
William A. Gale, David D. Lewis, A sequential algorithm for training text classifiers international acm sigir conference on research and development in information retrieval. pp. 3- 12 ,(1994) , 10.5555/188490.188495
Robert E. Schapire, Alina Beygelzimer, Lihong Li, Lev Reyzin, John Langford, Contextual Bandit Algorithms with Supervised Learning Guarantees international conference on artificial intelligence and statistics. ,vol. 15, pp. 19- 26 ,(2011)
Wei Chu, Martin Zinkevich, Lihong Li, Achint Thomas, Belle Tseng, Unbiased online active learning in data streams Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11. pp. 195- 203 ,(2011) , 10.1145/2020408.2020444