SAT: Improving Semi-Supervised Text Classification with Simple Instance-Adaptive Self-Training
Not on the map. Why?
Abstract (arXiv)
Self-training methods have been explored in recent years and have exhibited great performance in improving semi-supervised learning. This work presents a Simple instance-Adaptive self-Training method (SAT) for semi-supervised text classification. SAT first generates two augmented views for each unlabeled data and then trains a meta-learner to automatically identify the relative strength of augmentations based on the similarity between the original view and the augmented views. The weakly-augmented view is fed to the model to produce a pseudo-label and the strongly-augmented view is used to train the model to predict the same pseudo-label. We conducted extensive experiments and analyses on three text classification datasets and found that with varying sizes of labeled training data, SAT consistently shows competitive performance compared to existing semi-supervised learning methods. Our code can be found at urlhttps://github.com/declare-lab/SAT.git.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 17 of its 22 references that are in the map. First posted on arXiv 23 Oct 2022.
Builds on
17 of 22 references.
References · 17
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
- 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
- 2015Improving Neural Machine Translation Models with Monolingual Datacited by 784
- 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
- 2020MixText: Linguistically-Informed Interpolation of Hidden Space for Semi-Supervised Text Classificationcited by 186
- 2019Good-Enough Compositional Data Augmentationcited by 158
5 more
- 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 153
- 2021AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptationcited by 104
- 2016Edinburgh Neural Machine Translation Systems for WMT 16cited by 76
- 2021Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learningcited by 35
- 2022DoubleMix: Simple Interpolation-Based Data Augmentation for Text Classificationcited by 10
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 2.
5 papers.
- 2023JointMatch: A Unified Approach for Diverse and Collaborative Pseudo-Labeling to Semi-Supervised Text Classificationcited by 15
- 2023DeCrisisMB: Debiased Semi-Supervised Learning for Crisis Tweet Classification via Memory Bankcited by 10
- 2025MultiMatch: Multihead Consistency Regularization Matching for Semi-Supervised Text Classificationcited by 1
- 2024Self-Training for Sample-Efficient Active Learning for Text Classification with Pre-Trained Language Modelscited by 0
- 2025TCProF: Time-Complexity Prediction SSL Frameworkcited by 0
- 2025MultiMatch: Multihead Consistency Regularization Matching for Semi-Supervised Text Classification9 Jun 2025
- 2025TCProF: Time-Complexity Prediction SSL Framework10 Feb 2025
- 2024Self-Training for Sample-Efficient Active Learning for Text Classification with Pre-Trained Language Models13 Jun 2024
- 2023JointMatch: A Unified Approach for Diverse and Collaborative Pseudo-Labeling to Semi-Supervised Text Classification23 Oct 2023
- 2023DeCrisisMB: Debiased Semi-Supervised Learning for Crisis Tweet Classification via Memory Bank23 Oct 2023