Improve Cost Efficiency of Active Learning over Noisy Dataset
Not on the map. Why?
Abstract (arXiv)
Active learning is a learning strategy whereby the machine learning algorithm actively identifies and labels data points to optimize its learning. This strategy is particularly effective in domains where an abundance of unlabeled data exists, but the cost of labeling these data points is prohibitively expensive. In this paper, we consider cases of binary classification, where acquiring a positive instance incurs a significantly higher cost compared to that of negative instances. For example, in the financial industry, such as in money-lending businesses, a defaulted loan constitutes a positive event leading to substantial financial loss. To address this issue, we propose a shifted normal distribution sampling function that samples from a wider range than typical uncertainty sampling. Our simulation underscores that our proposed sampling function limits both noisy and positive label selection, delivering between 20% and 32% improved cost efficiency over different test datasets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 2 Mar 2024.
Builds on
7 of 27 references.
References · 7
- 2020A Survey of Deep Active Learningcited by 547
- 2019A Survey on Active Learning and Human-in-the-Loop Deep Learning for Medical Image Analysiscited by 150
- 2022Active Learning on a Budget: Opposite Strategies Suit High and Low Budgetscited by 131
- 2017Active Learning Using Uncertainty Informationcited by 28
- 2020Active Learning: Problem Settings and Recent Developmentscited by 23
- 2021Convergence of Uncertainty Sampling for Active Learningcited by 19
- 2018Uncertainty Sampling is Preconditioned Stochastic Gradient Descent on Zero-One Losscited by 10
Built on by
Not cited yet.