Practical Active Learning with Model Selection for Small Data

被引:5
作者
Pardakhti, Maryam [1 ,2 ]
Mandal, Nila [1 ]
Ma, Anson W. K. [1 ]
Yang, Qian [1 ]
机构
[1] Univ Connecticut, Comp Sci & Engn, Storrs, CT 06269 USA
[2] Univ Connecticut, Chem & Biomol Engn, Storrs, CT USA
来源
20TH IEEE INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2021) | 2021年
基金
美国食品与农业研究所;
关键词
active learning; model selection; small data; PARAMETERS;
D O I
10.1109/ICMLA52953.2021.00263
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Active learning is of great interest for many practical applications, especially in industry and the physical sciences, where there is a strong need to minimize the number of costly experiments necessary to train predictive models. However, there remain significant challenges for the adoption of active learning methods in many practical applications. One important challenge is that many methods assume a fixed model, where model hyperparameters are chosen a priori. In practice, it is rarely true that a good model will be known in advance. Existing methods for active learning with model selection typically depend on a medium-sized labeling budget. In this work, we focus on the case of having a very small labeling budget, on the order of a few dozen data points, and develop a simple and fast method for practical active learning with model selection. Our method is based on an underlying pool-based active learner for binary classification using support vector classification with a radial basis function kernel. First we show empirically that our method is able to find hyperparameters that lead to the best performance compared to an oracle model on less separable, difficult to classify datasets, and reasonable performance on datasets that are more separable and easier to classify. Then, we demonstrate that it is possible to refine our model selection method using a weighted approach to trade-off between achieving optimal performance on datasets that are easy to classify, versus datasets that are difficult to classify, which can be tuned based on prior domain knowledge about the dataset.
引用
收藏
页码:1647 / 1653
页数:7
相关论文
共 34 条
[1]  
Ali A, 2014, AAAI CONF ARTIF INTE, P1673
[2]  
[Anonymous], 2000, Icml
[3]  
[Anonymous], Artif. Intell. Mach. Learn.
[4]  
Attenberg J., 2011, ACM SIGKDD Explorations Newsletter, V12, P36, DOI DOI 10.1145/1964897.1964906
[5]  
Bach F. R, 2006, NIPS
[6]  
Baldridge Jason, 2004, EMNLP
[7]  
Baram Y, 2004, J MACH LEARN RES, V5, P255
[8]   Deep Active Learning for Joint Classification & Segmentation with Weak Annotator [J].
Belharbi, Soufiane ;
Ben Ayed, Ismail ;
McCaffrey, Luke ;
Granger, Eric .
2021 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION WACV 2021, 2021, :3337-3346
[9]  
Beygelzimer Alina, 2009, P 26 ANN INT C MACH, P49, DOI DOI 10.1145/1553374.1553381
[10]  
Campbell C., 2000, ICML