paper-with-me

홈 › Papers

Learning with Symmetric Label Noise: The Importance of Being Unhinged

2015-05-28 · NeurIPS 2015 12 · Brendan van Rooyen, Aditya Krishna Menon, Robert C. Williamson

Convex potential minimisation is the de facto approach to binary classification. However, Long and Servedio [2010] proved that under symmetric label noise (SLN), minimisation of any convex potential over a linear function class can result in classification performance equivalent to random guessing. This ostensibly shows that convex losses are not SLN-robust. In this paper, we propose a convex, classification-calibrated loss and prove that it is SLN-robust. The loss avoids the Long and Servedio [2010] result by virtue of being negatively unbounded. The loss is a modification of the hinge loss, where one does not clamp at zero; hence, we call it the unhinged loss. We show that the optimal unhinged solution is equivalent to that of a strongly regularised SVM, and is the limiting solution for any convex potential; this implies that strong l2 regularisation makes most standard learners SLN-robust. Experiments confirm the SLN-robustness of the unhinged loss.

📄 PDF Abstract BibTeX arXiv:1505.07634

Code (1)

dmizr/phuber pytorch

Tasks

Binary ClassificationClassificationGeneral Classification

Similar Papers 제목 키워드 기반

Symmetrization of Loss Functions for Robust Training of Neural Networks in the Presence of Noisy Labels

2026-05-19 · Alexandre Lemire Paquin, Brahim Chaib-Draa, Philippe Giguère arxiv

Labeling a training set is often expensive and susceptible to errors, making the design of robust loss functions for label noise an important problem. The symmetry condition provides theoretical guarantees for robustness…

The perils of being unhinged: On the accuracy of classifiers minimizing a noise-robust convex loss

2021-12-08 · Philip M. Long, Rocco A. Servedio

Van Rooyen et al. introduced a notion of convex loss functions being robust to random classification noise, and established that the "unhinged" loss function is robust in this sense. In this note we study the accuracy of…

TrustNet: Learning from Trusted Data Against (A)symmetric Label Noise

2020-07-13 · Amirmasoud Ghiassi, Taraneh Younesian, Robert Birke, Lydia Y. Chen

Robustness to label noise is a critical property for weakly-supervised classifiers trained on massive datasets. Robustness to label noise is a critical property for weakly-supervised classifiers trained on massive datase…

On the Dynamics Under the Unhinged Loss and Beyond

2023-12-13 · Xiong Zhou, Xianming Liu, Hanzhang Wang, Deming Zhai 외

Recent works have studied implicit biases in deep learning, especially the behavior of last-layer features and classifier weights. However, they usually need to simplify the intermediate dynamics under gradient flow or g…

Does label smoothing mitigate label noise?

2020-03-05 · ICML 2020 1 · Michal Lukasik, Srinadh Bhojanapalli, Aditya Krishna Menon, Sanjiv Kumar

Label smoothing is commonly used in training deep learning models, wherein one-hot training labels are mixed with uniform label vectors. Empirically, smoothing has been shown to improve both predictive performance and mo…

Learning with noisy labels