Making risk minimization tolerant to label noise

• Published in: Neurocomputing (Amsterdam) Vol. 160; pp. 93 - 107
• Main Authors: Ghosh, Aritra, Manwani, Naresh, Sastry, P.S.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 21-07-2015
• Subjects: Classification; Label noise; Loss function; Noise tolerance; Risk minimization; Loss function; Risk minimization; Noise tolerance; Label noise; Classification
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2014.09.081

In many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in the presence of label noise. In this paper we investigate the robustness of risk minimization to label noise. We prove a sufficient condition on a loss function for the risk minimization under that loss to be tolerant to uniform label noise. We show that the 0–1 loss, sigmoid loss, ramp loss and probit loss satisfy this condition though none of the standard convex loss functions satisfy it. We also prove that, by choosing a sufficiently large value of a parameter in the loss function, the sigmoid loss, ramp loss and probit loss can be made tolerant to non-uniform label noise also if we can assume the classes to be separable under noise-free data distribution. Through extensive empirical studies, we show that risk minimization under the 0–1 loss, the sigmoid loss and the ramp loss has much better robustness to label noise when compared to the SVM algorithm.