SelectMix: Enhancing Label Noise Robustness through Targeted Sample Mixing
Not on the map. Why?
Abstract (arXiv)
Deep neural networks tend to memorize noisy labels, severely degrading their generalization performance. Although Mixup has demonstrated effectiveness in improving generalization and robustness, existing Mixup-based methods typically perform indiscriminate mixing without principled guidance on sample selection and mixing strategy, inadvertently propagating noisy supervision. To overcome these limitations, we propose SelectMix, a confidence-guided mixing framework explicitly tailored for noisy labels. SelectMix first identifies potentially noisy or ambiguous samples through confidence based mismatch analysis using K-fold cross-validation, then selectively blends identified uncertain samples with confidently predicted peers from their potential classes. Furthermore, SelectMix employs soft labels derived from all classes involved in the mixing process, ensuring the labels accurately represent the composition of the mixed samples, thus aligning supervision signals closely with the actual mixed inputs. Through extensive theoretical analysis and empirical evaluations on multiple synthetic (MNIST, Fashion-MNIST, CIFAR-10, CIFAR-100) and real-world benchmark datasets (CIFAR-N, MNIST and Clothing1M), we demonstrate that SelectMix consistently outperforms strong baseline methods, validating its effectiveness and robustness in learning with noisy labels.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 69 of its 137 references that are in the map. First posted on arXiv 14 Sep 2025.
Builds on
69 of 137 references.
References · 69
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
- 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 500
38 more
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
- 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 413
- 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
- 2017WebVision Database: Visual Learning and Understanding from Web Datacited by 262
- 2020Puzzle Mix: Exploiting Saliency and Local Statistics for Optimal Mixupcited by 261
- 2015Strategic Classificationcited by 257
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 256
- 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
- 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
- 2020Learning with Instance-Dependent Label Noise: A Sample Sieve Approachcited by 158
- 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
- 2022AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuningcited by 137
- 2021Understanding and Improving Early Stopping for Learning with Noisy Labelscited by 113
- 2020A Second-Order Approach to Learning with Instance-Dependent Label Noisecited by 90
- 2020Multi-Objective Interpolation Training for Robustness to Label Noisecited by 86
- 2024DiffuseMix: Label-Preserving Data Augmentation with Diffusion Modelscited by 78
- 2022UNICON: Combating Label Noise Through Uniform Selection and Contrastive Learningcited by 77
- 2021To Smooth or Not? When Label Smoothing Meets Noisy Labelscited by 70
- 2020ResizeMix: Mixing Data with Preserved Object Information and True Labelscited by 69
- 2021Clusterability as an Alternative to Anchor Points When Learning with Noisy Labelscited by 65
- 2021Learning Noise Transition Matrix from Only Noisy Labels via Total Variation Regularizationcited by 62
- 2021Detecting Corrupted Labels Without Training a Model to Predictcited by 58
- 2014Making Risk Minimization Tolerant to Label Noisecited by 54
- 2015Bayesian Incentive-Compatible Bandit Explorationcited by 53
- 2022TokenMix: Rethinking Image Mixing for Data Augmentation in Vision Transformerscited by 48
- 2020When Optimizing f-divergence is Robust with Label Noisecited by 44
- 2021LongReMix: Robust Learning with High Confidence Samples in a Noisy Label Environmentcited by 40
- 2013Crowdsourced Judgement Elicitation with Endogenous Proficiencycited by 30
- 2022To Aggregate or Not? Learning with Separate Noisy Labelscited by 29
- 2014Optimum Statistical Estimation with Strategic Data Sourcescited by 28
- 2022TokenMixup: Efficient Attention-guided Token-level Data Augmentation for Transformerscited by 26
- 2016Informed Truthfulness in Multi-Task Peer Predictioncited by 25
- 2021Learning with Noisy Labels by Efficient Transition Matrix Estimation to Combat Label Miscorrectioncited by 20
- 2024A Survey on Mixup Augmentations and Beyondcited by 20
- 2023RankMixup: Ranking-Based Mixup Training for Network Calibrationcited by 19
- 2024Automatic Dataset Construction (ADC): Sample Collection, Data Curation, and Beyondcited by 18
- 2022Instance-Dependent Noisy Label Learning via Graphical Modellingcited by 17
50 most cited of 69 All 69 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 4.
5 papers.
- 2026CausalRM: Causal-Theoretic Reward Modeling for RLHF from Observational User Feedbackscited by 7
- 2025Label Smoothing Improves Gradient Ascent in LLM Unlearningcited by 3
- 2026ImplicitRM: Unbiased Reward Modeling from Implicit Preference Data for LLM alignmentcited by 3
- 2026Optimal Transport for LLM Reward Modeling from Noisy Preferencecited by 3
- 2026Replay What Matters: Off-Policy Replay for Efficient LLM Reinforcement Unlearningcited by 0
- 2026Replay What Matters: Off-Policy Replay for Efficient LLM Reinforcement Unlearning13 Jun 2026
- 2026Optimal Transport for LLM Reward Modeling from Noisy Preference7 May 2026
- 2026ImplicitRM: Unbiased Reward Modeling from Implicit Preference Data for LLM alignment24 Mar 2026
- 2026CausalRM: Causal-Theoretic Reward Modeling for RLHF from Observational User Feedbacks19 Mar 2026
- 2025Label Smoothing Improves Gradient Ascent in LLM Unlearning25 Oct 2025