Robust Contrastive Active Learning with Feature-guided Query Strategies
Not on the map. Why?
Abstract (arXiv)
We introduce supervised contrastive active learning (SCAL) and propose efficient query strategies in active learning based on the feature similarity (featuresim) and principal component analysis based feature-reconstruction error (fre) to select informative data samples with diverse feature representations. We demonstrate our proposed method achieves state-of-the-art accuracy, model calibration and reduces sampling bias in an active learning setup for balanced and imbalanced datasets on image classification tasks. We also evaluate robustness of model to distributional shift derived from different query strategies in active learning setting. Using extensive experiments, we show that our proposed approach outperforms high performing compute-intensive methods by a big margin resulting in 9.9% lower mean corruption error, 7.2% lower expected calibration error under dataset shift and 8.9% higher AUROC for out-of-distribution detection.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 32 of its 55 references that are in the map. First posted on arXiv 13 Sep 2021.
Builds on
32 of 55 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2020Supervised Contrastive Learningcited by 2,829
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,287
- 2019CheXpert: A Large Chest Radiograph Dataset with Uncertainty Labels and Expert Comparisoncited by 1,423
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
20 more
- 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,380
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,287
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2017Deep Bayesian Active Learning with Image Datacited by 819
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 705
- 2020A Survey of Deep Active Learningcited by 554
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2020CSI: Novelty Detection via Contrastive Learning on Distributionally Shifted Instancescited by 441
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
- 2019Learning Loss for Active Learningcited by 336
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
- 2020Contrastive learning, multi-view redundancy, and linear modelscited by 146
- 2020Uncertainty as a Form of Transparency: Measuring, Communicating, and Using Uncertaintycited by 129
- 2020Improving model calibration with accuracy versus uncertainty optimizationcited by 123
- 2017Deep Active Learning for Named Entity Recognitioncited by 108
- 2019Deep Active Learning: Unified and Principled Method for Query and Trainingcited by 93
- 2021On Statistical Bias In Active Learning: How and When To Fix Itcited by 75
- 2019Probabilistic Modeling of Deep Features for Out-of-Distribution and Adversarial Detectioncited by 39
- 2019Specifying Weight Priors in Bayesian Deep Neural Networks with Empirical Bayescited by 32
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.