Density Weighted Diversity Based Query Strategy for Active Learning
Title | Density Weighted Diversity Based Query Strategy for Active Learning |
Publication Type | Conference Paper |
Year of Publication | 2021 |
Authors | Wang, Tingting, Zhao, Xufeng, Lv, Qiujian, Hu, Bo, Sun, Degang |
Conference Name | 2021 IEEE 24th International Conference on Computer Supported Cooperative Work in Design (CSCWD) |
Date Published | May 2021 |
Publisher | IEEE |
ISBN Number | 978-1-7281-6597-4 |
Keywords | active learning, Approximation algorithms, Classification algorithms, Deep Learning, density, diversity, Geometry, informativeness, Linear programming, predictability, pubcrawl, Representativeness, resilience, Resiliency, Scalability, search problems, Security Heuristics, Training |
Abstract | Deep learning has made remarkable achievements in various domains. Active learning, which aims to reduce the budget for training a machine-learning model, is especially useful for the Deep learning tasks with the demand of a large number of labeled samples. Unfortunately, our empirical study finds that many of the active learning heuristics are not effective when applied to Deep learning models in batch settings. To tackle these limitations, we propose a density weighted diversity based query strategy (DWDS), which makes use of the geometry of the samples. Within a limited labeling budget, DWDS enhances model performance by querying labels for the new training samples with the maximum informativeness and representativeness. Furthermore, we propose a beam-search based method to obtain a good approximation to the optimum of such samples. Our experiments show that DWDS outperforms existing algorithms in Deep learning tasks. |
URL | https://ieeexplore.ieee.org/document/9437695 |
DOI | 10.1109/CSCWD49262.2021.9437695 |
Citation Key | wang_density_2021 |