Enhancing Semi-Supervised Learning via Representative and Diverse Sample Selection
Not on the map. Why?
Abstract (arXiv)
Semi-Supervised Learning (SSL) has become a preferred paradigm in many deep learning tasks, which reduces the need for human labor. Previous studies primarily focus on effectively utilising the labelled and unlabeled data to improve performance. However, we observe that how to select samples for labelling also significantly impacts performance, particularly under extremely low-budget settings. The sample selection task in SSL has been under-explored for a long time. To fill in this gap, we propose a Representative and Diverse Sample Selection approach (RDSS). By adopting a modified Frank-Wolfe algorithm to minimise a novel criterion α-Maximum Mean Discrepancy (α-MMD), RDSS samples a representative and diverse subset for annotation from the unlabeled data. We demonstrate that minimizing α-MMD enhances the generalization ability of low-budget learning. Experimental results show that RDSS consistently improves the performance of several popular SSL frameworks and outperforms the state-of-the-art sample selection approaches used in Active Learning (AL) and Semi-Supervised Active Learning (SSAL), even with constrained annotation budgets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 35 of its 68 references that are in the map. First posted on arXiv 18 Sep 2024.
Builds on
35 of 68 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2016Wide Residual Networkscited by 3,070
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,311
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,060
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,057
- 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 540
- 2016Regularization With Stochastic Transformations and Perturbations for Deep Semi-Supervised Learningcited by 441
- 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 364
- 2019Learning Loss for Active Learningcited by 336
- 2019Variational Adversarial Active Learningcited by 284
23 more
- 2022FreeMatch: Self-adaptive Thresholding for Semi-supervised Learningcited by 232
- 2017Cost-Effective Active Learning for Deep Image Classificationcited by 166
- 2019Consistency-based Semi-supervised Active Learning: Towards Minimizing Labeling Costcited by 114
- 2022USB: A Unified Semi-supervised Learning Benchmark for Classificationcited by 95
- 2022Debiased Learning from Naturally Imbalanced Pseudo-Labelscited by 85
- 2021Influence Selection for Active Learningcited by 84
- 2021Semi-Supervised Active Learning with Temporal Output Discrepancycited by 50
- 2016Support pointscited by 39
- 2023Active Finetuning: Exploiting Annotation Budget in the Pretraining-Finetuning Paradigmcited by 36
- 2021Low Budget Active Learning via Wasserstein Distance: An Integer Programming Approachcited by 34
- 2021Unsupervised Selective Labeling for More Effective Semi-Supervised Learningcited by 27
- 2020Concentration Inequalities for Statistical Inferencecited by 24
- 2020On the Marginal Benefit of Active Learning: Does Self-Supervision Eat Its Cake?cited by 18
- 2021MCDAL: Maximum Classifier Discrepancy for Active Learningcited by 18
- 2019Combining MixMatch and Active Learning for Better Accuracy with Fewer Labelscited by 17
- 2023Shrinking Class Space for Enhanced Certainty in Semi-Supervised Learningcited by 17
- 2020Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators with Massive Datacited by 13
- 2023InstanT: Semi-supervised Learning with Instance-dependent Thresholdscited by 13
- 2018Optimal Subsampling Algorithms for Big Data Regressionscited by 11
- 2022Don't fear the unlabelled: safe semi-supervised learning via simple debiasingcited by 10
- 2021Performance analysis of greedy algorithms for minimising a Maximum Mean Discrepancycited by 7
- 2022An optimal transport approach for selecting a representative subsample with application in efficient kernel density estimationcited by 4
- 2022Model-free Subsampling Method Based on Uniform Designscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.