English

On the Robustness of Active Learning

Computer Vision and Pattern Recognition 2020-06-19 v1 Machine Learning

Abstract

Active Learning is concerned with the question of how to identify the most useful samples for a Machine Learning algorithm to be trained with. When applied correctly, it can be a very powerful tool to counteract the immense data requirements of Artificial Neural Networks. However, we find that it is often applied with not enough care and domain knowledge. As a consequence, unrealistic hopes are raised and transfer of the experimental results from one dataset to another becomes unnecessarily hard. In this work we analyse the robustness of different Active Learning methods with respect to classifier capacity, exchangeability and type, as well as hyperparameters and falsely labelled data. Experiments reveal possible biases towards the architecture used for sample selection, resulting in suboptimal performance for other classifiers. We further propose the new "Sum of Squared Logits" method based on the Simpson diversity index and investigate the effect of using the confusion matrix for balancing in sample selection.

Keywords

Cite

@article{arxiv.2006.10370,
  title  = {On the Robustness of Active Learning},
  author = {Lukas Hahn and Lutz Roese-Koerner and Peet Cremer and Urs Zimmermann and Ori Maoz and Anton Kummert},
  journal= {arXiv preprint arXiv:2006.10370},
  year   = {2020}
}

Comments

11 pages, 6 figures, 1 table; as published in the proceedings of the 5th Global Conference on Artificial Intelligence (GCAI), EPiC Series in Computing, Volume 65, pages 152-162, https://doi.org/10.29007/thws, 2019

R2 v1 2026-06-23T16:25:35.622Z