Can Active Learning Experience Be Transferred

作者: Hsuan-Tien Lin , Hong-Min Chu

DOI:

关键词:

摘要: Active learning is an important machine problem in reducing the human labeling effort. Current active strategies are designed from knowledge, and applied on each dataset immutable manner. In other words, experience about usefulness of cannot be updated transferred to improve datasets. This paper initiates a pioneering study whether can transferred. We first propose novel model that linearly aggregates existing strategies. The linear weights then used represent experience. equip with popular upper- confidence-bound (LinUCB) algorithm for contextual bandit update weights. Finally, we extend our transfer across datasets technique biased regularization. Empirical studies demonstrate learned not only competitive most single datasets, but also performance future tasks.

参考文章(24)
Wei-Ning Hsu, Hsuan-Tien Lin, Active learning by learning national conference on artificial intelligence. pp. 2659- 2665 ,(2015)
Robert E. Schapire, Wei Chu, Lihong Li, Lev Reyzin, Contextual bandits with linear Payoff functions international conference on artificial intelligence and statistics. ,vol. 15, pp. 208- 214 ,(2011)
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
Xiaoxiao Shi, Wei Fan, Jiangtao Ren, Actively transfer domain knowledge european conference on machine learning. pp. 342- 357 ,(2008) , 10.1007/978-3-540-87481-2_23
Yoram Baram, Ran El-Yaniv, Kobi Luz, Online choice of active learning algorithms international conference on machine learning. pp. 19- 26 ,(2003)
Chun-Liang Li, Chun-Sung Ferng, Hsuan-Tien Lin, Active learning using hint information Neural Computation. ,vol. 27, pp. 1738- 1765 ,(2015) , 10.1162/NECO_A_00755
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)
David Kale, Yan Liu, Accelerating Active Learning with Transfer Learning international conference on data mining. pp. 1085- 1090 ,(2013) , 10.1109/ICDM.2013.160