Querying Easily Flip-flopped Samples for Deep Active Learning
Not on the map. Why?
Abstract (arXiv)
Active learning is a machine learning paradigm that aims to improve the performance of a model by strategically selecting and querying unlabeled data. One effective selection strategy is to base it on the model's predictive uncertainty, which can be interpreted as a measure of how informative a sample is. The sample's distance to the decision boundary is a natural measure of predictive uncertainty, but it is often intractable to compute, especially for complex decision boundaries formed in multiclass classification tasks. To address this issue, this paper proposes the it least disagree metric (LDM), defined as the smallest probability of disagreement of the predicted label, and an estimator for LDM proven to be asymptotically consistent under mild assumptions. The estimator is computationally efficient and can be easily implemented for deep learning models using parameter perturbation. The LDM-based active learning is performed by querying unlabeled data with the smallest LDM. Experimental results show that our LDM-based active learning algorithm obtains state-of-the-art overall performance on all considered datasets and deep architectures.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 35 of its 88 references that are in the map. First posted on arXiv 18 Jan 2024.
Builds on
35 of 88 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Wide Residual Networkscited by 3,057
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2017Deep Bayesian Active Learning with Image Datacited by 812
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 602
- 2014OpenML: networked science in machine learningcited by 523
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
- 2019Learning Loss for Active Learningcited by 335
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
23 more
- 2019Variational Adversarial Active Learningcited by 284
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 155
- 2021Batch Active Learning at Scalecited by 127
- 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
- 2021Gone Fishing: Neural Active Learning with Fisher Embeddingscited by 88
- 2020Sequential Graph Convolutional Network for Active Learningcited by 69
- 2019Bayesian Batch Active Learning as Sparse Subset Approximationcited by 68
- 2022Active Learning Through a Covering Lenscited by 62
- 2020State-Relabeling Adversarial Active Learningcited by 60
- 2020Is SGD a Bayesian sampler? Well, almostcited by 50
- 2021Stochastic Batch Acquisition: A Simple Baseline for Deep Active Learningcited by 36
- 2021Low Budget Active Learning via Wasserstein Distance: An Integer Programming Approachcited by 34
- 2021Deep Active Learning by Leveraging Training Dynamicscited by 32
- 2022Making Look-Ahead Active Learning Strategies Feasible with Neural Tangent Kernelscited by 25
- 2018Dropout-based Active Learning for Regressioncited by 24
- 2022A Lagrangian Duality Approach to Active Learningcited by 24
- 2020Understanding the Decision Boundary of Deep Neural Networks: An Empirical Studycited by 19
- 2021Convergence of Uncertainty Sampling for Active Learningcited by 19
- 2021Active Learning in Bayesian Neural Networks with Balanced Entropy Learning Principlecited by 14
- 2021Nuances in Margin Conditions Determine Gains in Active Learningcited by 9
- 2017Influence of Resampling on Accuracy of Imbalanced Classificationcited by 8
- 2019Deeper Connections between Neural Networks and Gaussian Processes Speed-up Active Learningcited by 4
- 2017Model Selection for Anomaly Detectioncited by 1
Built on by
Citing papers per year: 2024: 3; 2025: 4.
7 papers.
- 2024Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samplescited by 5
- 2025Enhancing Cost Efficiency in Active Learning with Candidate Set Querycited by 3
- 2024DCoM: Active Learning for All Learnerscited by 2
- 2024Parameter-Efficient Active Learning for Foundational modelscited by 1
- 2025Adaptation Method for Misinformation Identificationcited by 0
- 2025Optimizing Active Learning in Vision-Language Models via Parameter-Efficient Uncertainty Calibrationcited by 0
- 2025SAMOSA: Sharpness Aware Minimization for Open Set Active learningcited by 0
- 2025SAMOSA: Sharpness Aware Minimization for Open Set Active learning19 Oct 2025
- 2025Optimizing Active Learning in Vision-Language Models via Parameter-Efficient Uncertainty Calibration29 Jul 2025
- 2025Adaptation Method for Misinformation Identification19 Apr 2025
- 2025Enhancing Cost Efficiency in Active Learning with Candidate Set Query10 Feb 2025
- 2024DCoM: Active Learning for All Learners1 Jul 2024
- 2024Parameter-Efficient Active Learning for Foundational models13 Jun 2024
- 2024Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samples6 Jun 2024