Cost-Sensitive Self-Training for Optimizing Non-Decomposable Metrics
Not on the map. Why?
Abstract (arXiv)
Self-training based semi-supervised learning algorithms have enabled the learning of highly accurate deep neural networks, using only a fraction of labeled data. However, the majority of work on self-training has focused on the objective of improving accuracy, whereas practical machine learning systems can have complex goals (e.g. maximizing the minimum of recall across classes, etc.) that are non-decomposable in nature. In this work, we introduce the Cost-Sensitive Self-Training (CSST) framework which generalizes the self-training-based methods for optimizing non-decomposable metrics. We prove that our framework can better optimize the desired non-decomposable metric utilizing unlabeled data, under similar data distribution assumptions made for the analysis of self-training. Using the proposed CSST framework, we obtain practical self-training methods (for both vision and NLP tasks) for optimizing different non-decomposable metrics using deep neural networks. Our results demonstrate that CSST achieves an improvement over the state-of-the-art in majority of the cases across datasets and objectives.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 32 of its 56 references that are in the map. First posted on arXiv 28 Apr 2023.
Builds on
32 of 56 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2016Wide Residual Networkscited by 3,070
- 2016Visual Genome: Connecting Language and Vision Using Crowdsourced Dense Image Annotationscited by 2,656
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,311
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,060
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,057
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
20 more
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
- 2020Long-tail learning via logit adjustmentcited by 618
- 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 540
- 2014Semi-Supervised Learning with Deep Generative Modelscited by 496
- 2019Agnostic Federated Learningcited by 456
- 2019Confidence Regularized Self-Trainingcited by 419
- 2020Meta Pseudo Labelscited by 374
- 2018Marian: Fast Neural Machine Translation in C++cited by 203
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 180
- 2021CReST: A Class-Rebalancing Self-Training Framework for Imbalanced Semi-Supervised Learningcited by 175
- 2017Asymmetric Tri-training for Unsupervised Domain Adaptationcited by 152
- 2020Distribution Aligning Refinery of Pseudo-label for Imbalanced Semi-supervised Learningcited by 105
- 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
- 2016Satisfying Real-world Goals with Dataset Constraintscited by 68
- 2019Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margincited by 56
- 2019Addressing the Loss-Metric Mismatch with Adaptive Loss Alignmentcited by 33
- 2021Training Over-parameterized Models with Non-decomposable Objectivescited by 11
- 2018Optimizing Non-decomposable Measures with Deep Networkscited by 10
- 2021Implicit Rate-Constrained Optimization of Non-decomposable Objectivescited by 9
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024Selective Mixup Fine-Tuning for Optimizing Non-Decomposable Objectivescited by 2
- 2024Learning from Limited and Imperfect Datacited by 0
- 2025Cost-Sensitive Learning for Long-Tailed Temporal Action Segmentationcited by 0
- 2025Learning from Limited and Imperfect Datacited by 0
- 2025Learning from Limited and Imperfect Data28 Jul 2025
- 2025Cost-Sensitive Learning for Long-Tailed Temporal Action Segmentation24 Mar 2025
- 2024Learning from Limited and Imperfect Data11 Nov 2024
- 2024Selective Mixup Fine-Tuning for Optimizing Non-Decomposable Objectives27 Mar 2024