ε-Softmax: Approximating One-Hot Vectors for Mitigating Label Noise
Not on the map. Why?
Abstract (arXiv)
Noisy labels pose a common challenge for training accurate deep neural networks. To mitigate label noise, prior studies have proposed various robust loss functions to achieve noise tolerance in the presence of label noise, particularly symmetric losses. However, they usually suffer from the underfitting issue due to the overly strict symmetric condition. In this work, we propose a simple yet effective approach for relaxing the symmetric condition, namely ε-softmax, which simply modifies the outputs of the softmax layer to approximate one-hot vectors with a controllable error ε. Essentially, ε-softmax not only acts as an alternative for the softmax layer, but also implicitly plays the crucial role in modifying the loss function. We prove theoretically that ε-softmax can achieve noise-tolerant learning with controllable excess risk bound for almost any loss function. Recognizing that ε-softmax-enhanced losses may slightly reduce fitting ability on clean datasets, we further incorporate them with one symmetric loss, thereby achieving a better trade-off between robustness and effective learning. Extensive experiments demonstrate the superiority of our method in mitigating synthetic and real-world label noise. The code is available at https://github.com/cswjl/eps-softmax.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 36 of its 49 references that are in the map. First posted on arXiv 4 Aug 2025.
Builds on
36 of 49 references.
References · 36
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
- 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
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
- 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 500
- 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 467
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
24 more
- 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
- 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
- 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 256
- 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
- 2020Learning with Instance-Dependent Label Noise: A Sample Sieve Approachcited by 158
- 2019NLNL: Negative Learning for Noisy Labelscited by 151
- 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
- 2020A Survey of Label-noise Representation Learning: Past, Present and Futurecited by 122
- 2015Learning with Symmetric Label Noise: The Importance of Being Unhingedcited by 120
- 2021Understanding and Improving Early Stopping for Learning with Noisy Labelscited by 113
- 2021Provably End-to-end Label-Noise Learning without Anchor Pointscited by 97
- 2022Robust Training under Label Noise by Over-parameterizationcited by 93
- 2020A Second-Order Approach to Learning with Instance-Dependent Label Noisecited by 90
- 2021Generalized Jensen-Shannon Divergence Loss for Learning with Noisy Labelscited by 74
- 2021To Smooth or Not? When Label Smoothing Meets Noisy Labelscited by 70
- 2021Asymmetric Loss Functions for Learning with Noisy Labelscited by 46
- 2020When Optimizing f-divergence is Robust with Label Noisecited by 44
- 2022Mitigating Memorization of Noisy Labels by Clipping the Model Predictioncited by 40
- 2021Learning with Noisy Labels via Sparse Regularizationcited by 39
- 2019On the Consistency of Top-k Surrogate Lossescited by 35
- 2021Label Distributionally Robust Losses for Multi-class Classification: Consistency, Robustness and Adaptivitycited by 11
- 2023Rethinking Noisy Label Learning in Real-world Annotation Scenarios from the Noise-type Perspectivecited by 2
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2026Optimal Transport for LLM Reward Modeling from Noisy Preferencecited by 3
- 2025Foundation Model Priors Enhance Object Focus in Feature Space for Source-Free Object Detectioncited by 2
- 2025What's on My Network? Using Large Language Models to Identify Real-World IoT Devices at Scalecited by 1
- 2025Learning to Forget with Information Divergence Reweighted Objectives for Noisy Labelscited by 0
- 2026Evolution-Inspired Sample Competition for Deep Neural Network Optimizationcited by 0
- 2026Robust Losses from Univariate Base Functions for Noisy-Label Learningcited by 0
- 2026Robust Losses from Univariate Base Functions for Noisy-Label Learning18 Jul 2026
- 2026Optimal Transport for LLM Reward Modeling from Noisy Preference7 May 2026
- 2026Evolution-Inspired Sample Competition for Deep Neural Network Optimization14 Apr 2026
- 2025Foundation Model Priors Enhance Object Focus in Feature Space for Source-Free Object Detection19 Dec 2025
- 2025What's on My Network? Using Large Language Models to Identify Real-World IoT Devices at Scale24 Sep 2025
- 2025Learning to Forget with Information Divergence Reweighted Objectives for Noisy Labels8 Aug 2025