$\epsilon$-Softmax: Approximating One-Hot Vectors for Mitigating Label Noise
Jialiang Wang, Xiong Zhou, Deming Zhai, Junjun Jiang, Xiangyang Ji, Xianming Liu

TL;DR
This paper introduces $\\epsilon$-softmax, a method that approximates one-hot vectors to improve deep neural network robustness against label noise by relaxing the symmetric condition, with theoretical guarantees and empirical validation.
Contribution
Proposes $\\epsilon$-softmax to relax the symmetric condition, enabling noise-tolerant learning with theoretical risk bounds and improved robustness in practice.
Findings
Outperforms existing methods on synthetic label noise datasets
Achieves better robustness-accuracy trade-off on real-world noisy data
Theoretically guarantees noise tolerance with controllable excess risk
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsMachine Learning and Data Classification · Text and Document Classification Technologies · Explainable Artificial Intelligence (XAI)
