1 Introduction
Modern deep neural networks (DNNs) are often highly complex models that have hundreds of layers and millions of trainable parameters, requiring largescale datasets with clean label annotations such as ImageNet
[2]for proper training. However, labeling largescale datasets is a costly and errorprone process, and even highquality datasets are likely to contain noisy (incorrect) labels. Therefore, training accurate DNNs in the presence of noisy labels has become a task of great practical importance in deep learning.
Recently, several works have studied the dynamics of DNN learning with noisy labels. Zhang et.al [28] argued that DNNs exhibit memorization effects whereby they first memorize the training data for clean labels and then subsequently memorize data for the noisy labels. Similar findings are also reported in [1] that DNNs first learn clean and easy patterns and eventually memorize the wrongly assigned labels. Further evidence is provided in [13] that DNNs first learn simple representations via subspace dimensionality compression and then overfit to noisy labels via subspace dimensionality expansion. Different findings are reported in [19]
, where DNNs with a specific activation function (
i.e., tanh) undergo an initial label fitting phase then a subsequent representation compression phase where the overfitting starts. Despite these important findings, a complete understanding of DNN learning behavior, particularly their learning process for noisy labels, remains an open question.In this paper, we provide further insights into the learning procedure of DNNs by investigating the learning dynamics across classes. While Cross Entropy (CE) loss is the most commonly used loss for training DNNs, we have found that DNN learning with CE can be classbiased: some classes (“easy” classes) are easy to learn and converge faster than other classes (“hard” classes). As shown in Figure 0(a), even when labels are clean, the classwise test accuracy spans a wide range during the entire training process. As further shown in Figure 0(b), this phenomenon is amplified when training labels are noisy: whilst easy classes (e.g., class 6) already overfit to noisy labels, hard classes (e.g., class 3) still suffer from significant under learning (class accuracy significantly lower than clean label setting). Specifically, class 3 (bottom curve) only has an accuracy of at the end, considerably less than the accuracy of class 6 (top curve). Label Smoothing Regularization (LSR) [21, 17] is a widely known technique to ease overfitting issues, as shown in Figure 0(c), which still exhibits significant under learning on hard classes. Comparing the overall test accuracy (solid red curve) in Figure 1, a low test accuracy (under learning) on hard classes is a barrier to high overall accuracy. This is a different finding from previous belief that poor performance is simply caused by overfitting to noisy labels. We also visualize the learned representations for the noisy label case in Figure 1(b): some clusters are learned comparably well to those learned with clean labels (Figure 1(a)), while some other clusters do not have clear separated boundaries.
Visualization of learned representations on CIFAR10 using tSNE 2D embeddings of deep features at the last second dense layer with (a) CE on clean labels, (b) CE on 40% symmetric noisy labels, (c) the proposed SL on the same setting to (b).
Intuitively, CE requires an extra term to improve its learning on hard classes, and more importantly, this term needs to be tolerant to label noise. Inspired by the symmetric KLdivergence, we propose such a noise tolerant term, namely Reverse Cross Entropy (RCE), which combined with CE forms the basis of the approach Symmetric cross entropy Learning (SL). SL not only promotes sufficient learning (class accuracy close to clean label setting) of hard classes, but also improves the robustness of DNNs to noisy labels. As a preview of this, we can inspect the improved learning curves of classwise test accuracy and representations in Figure 0(d) and 1(c). Under the same 40% noise setting, the variation of classwise test accuracy has been narrowed by SL to 20% with 95% the highest and 75% the lowest (Figure 0(d)), and the learned representations are of better quality with more separated clusters (Figure 1(c)), both of which are very close to the clean settings.
Compared to existing approaches that often involve architectural or nontrivial algorithmic modifications, SL is extremely simple to use. It requires minimal intervention to the training process and thus can be straightforwardly incorporated into existing models to further enhance their performance. In summary, our main contributions are:

We provide insights into the classbiased learning procedure of DNNs with CE loss and find that the under learning problem of hard classes is a key bottleneck for learning with noisy labels.

We propose a Symmetric Learning (SL) approach, to simultaneously address the hard class under learning problem and the noisy label overfitting problem of CE. We provide both theoretical analysis and empirical understanding of SL.

We empirically demonstrate that SL can achieve better robustness than stateoftheart methods, and can be also easily incorporated into existing methods to significantly improve their performance.
2 Related Work
Different approaches have been proposed to train accurate DNNs with noisy labels, and they can be roughly divided into three categories: 1) label correction methods, 2) loss correction methods, and 3) refined training strategies.
The idea of label correction is to improve the quality of the raw labels. One common approach is to correct noisy labels to their true labels via a clean label inference step using complex noise models characterized by directed graphical models [26], conditional random fields [23], neural networks [11, 24]
[12]. These methods require the support from extra clean data or an expensive detection process to estimate the noise model.
Loss correction methods modify the loss function for robustness to noisy labels. One approach is to model the noise transition matrix that defines the probability of one class changed to another class
[5]. Backward [16] and Forward [16] are two such correction methods that use the noise transition matrix to modify the loss function. However, the groundtruth noise transition matrix is not always available in practice, and it is also difficult to obtain accurate estimation [5]. Work in [4, 20] augments the correction architecture by adding a linear layer on top of the neural network. Bootstrap [18] uses a combination of raw labels and their predicted labels. There is also research that defines noise robust loss functions, such as Mean Absolute Error (MAE) [3], but a challenge is that training a network with MAE is slow due to gradient saturation. Generalized Cross Entropy (GCE) loss [29] applies a BoxCox transformation to probabilities (power law function of probability with exponent ) and can behave like a weighted MAE. Label Smoothing Regularization (LSR) [21, 17] is another technique using soft labels in place of onehot labels to alleviate overfitting to noisy labels.Refined training strategies design new learning paradigms for noisy labels. MentorNet [8, 27] supervises the training of a StudentNet by a learned sample weighting scheme in favor of probably correct labels. Decoupling training strategy [15] trains two networks simultaneously, and parameters are updated when their predictions disagree. Coteaching [6] maintains two networks simultaneously during training, with one network learning from the other network’s most confident samples. These studies all require training of an auxiliary network for sample weighting or learning supervision. D2L [13] uses subspace dimensionality adapted labels for learning, paired with a training process monitor. The iterative learning framework [25] iteratively detects and isolates noisy samples during the learning process. The joint optimization framework [22]
updates DNN parameters and labels alternately. These methods either rely on complex interventions into the learning process, which may be challenging to adapt and tune, or are sensitive to hyperparameters like the number of training epochs and learning rate.
3 Weakness of Cross Entropy
We begin by analyzing the Cross Entropy (CE) and its limitations for learning with noisy labels.
3.1 Preliminaries
Given a class dataset , with denoting a sample in the dimensional input space and its associated label. For each sample
, a classifier
computes its probability of each label : , whereare the logits. We denote the groundtruth distribution over labels for sample
by , and . Consider the case of a single groundtruth label , then and for all . The cross entropy loss for sample is:(1) 
3.2 Weakness of CE under Noisy Labels
We now highlight some weaknesses of CE for DNN learning with noisy labels, based on empirical evidence on CIFAR10 dataset [9] (10 classes of natural images). To generate noisy labels, we randomly flip a correct label to one of the other 9 incorrect labels uniformly (e.g.
, symmetric label noise), and refer to the portion of incorrect labels as the noise rate. The network used here is an 8layer convolutional neural network (CNN). Detailed experimental settings can be found in Section
5.1.We first explore in more detail the classbiased phenomenon shown in Figure 0(a) and 0(b), focusing on three distinct learning stages: early (the th epoch), middle (the th epoch) and later (the th epoch) stages, with respect to total 120 epochs of training. As illustrated in Figure 3, CE learning starts in a highly classbiased manner (the blue curves) for both clean labels and 40% noisy labels. This is because patterns inside of samples are intrinsically different. For clean labels, the network eventually manages to learn all classes uniformly well, reflected by the relatively flat accuracy curve across classes (the green curve in Figure 2(a)). However, for noisy labels, the classwise test accuracy varies significantly across different classes, even at the later stage (the green curve in Figure 2(b)). In particular, the network struggles to learn hard classes (e.g., class ) with up to a 20% gap to the clean setting, whereas some easy classes (e.g., class ) are better learned and already start overfitting to noisy labels (accuracy drops from epoch 50 to 100). It appears that the under learning of hard classes is a major cause for the overall performance degradation, due to the fact that the accuracy drop caused by overfitting is relatively small.
We further investigate the reason behind the under learning of CE on hard classes from the perspective of representations. Due to their high similarities in representations to some other classes (see the red cluster for class 3 in Figure 1(a)), the predictions for hard class examples are likely to assign a relatively large probability to those similar classes. Under the noisy label scenario, class 3 has become even more scattered into other classes (red cluster in Figure 1(b)). As a consequence, no visible cluster was learned by CE, even though there are still 60% correct labels in this scenario. Further delving into these 60% clean portion of class 3 samples, we show, in Figure 3(a), their prediction confidence output of the neural network. Although the confidence at class 3 is the highest, it is only around 0.5, while for the other classes, the confidence is around 0.05 or 0.1 which is actually a relatively high value and an indication of insufficient learning of class 3 even on the clean labeled part. Another evidence of under learning can be obtained from Figure 3(b), where hard classes (e.g., class ) have fewer true positive samples throughout intermediate stages of learning.
Clearly, CE by itself is not sufficient for learning of hard classes, especially under the noisy label scenario. We note that this finding sheds new insights into DNN learning behavior under label noise, and differs from previous belief that DNNs overfit to all classes in general [1, 28]. In the next section, we propose a symmetric learning approach that can address both the hard class under learning and noisy label overfitting problems of CE.
4 Symmetric Cross Entropy Learning
In this section, we propose Symmetric cross entropy Learning (SL), an approach that strikes a balance between sufficient learning and robustness to noisy labels. We also provide theoretical analysis about the formulation and behavior of SL.
4.1 Definition
Given two distributions and , the relation between the cross entropy (denoted as ) and the KLdivergence (denoted as ) is:
(2) 
where is the entropy of . In the context of classification, is the ground truth class distribution conditioned on sample , whilst is the predicted distribution over labels by the classifier . From the perspective of KLdivergence, classification is to learn a prediction distribution that is close to the ground truth distribution , which is to minimize the KLdivergence between the two distributions^{*}^{*}*In practice, the term is a constant for a given class distribution and therefore omitted from Eq. (2) giving the CE loss in Eq. (1)..
In information theory, given a true distribution and its approximation , measures the penalty on encoding samples from using code optimized for (penalty in the number of extra bits required). In the context of noisy labels, we know that does not represent the true class distribution, instead can reflect the true distribution to a certain extent. Thus, in addition to taking as the ground truth, we also need to consider the other direction of KLdivergence, that is , to punish coding samples that come from when using a code for . The symmetric KLdivergence is:
(3) 
Transferring this symmetric idea from KLdivergence to cross entropy gives us the Symmetric Cross Entropy (SCE):
(4) 
where is the reverse version of , namely, Reverse Cross Entropy. The RCE loss for a sample is:
(5) 
The samplewise SCE loss can then be defined as:
(6) 
While the RCE term is noise tolerant as will be proved in Section 4.2, the CE term is not robust to label noise [3]. However, CE is useful for achieving good convergence [29], which will be verified empirically in Section 5. Towards more effective and robust learning, we propose a flexible symmetric learning framework with the use of two decoupled hyperparameters (e.g., and ), with on the overfitting issue of CE while for flexible exploration on the robustness of RCE. Formally, the SL loss is:
(7) 
As the ground truth distribution is now inside of the logarithm in , this could cause computational problem when labels are onehot: zero values inside the logarithm. To solve this issue, we define (where is some constant), which shortly will be proved useful for the robustness of in Theorem 1. This technique is similar to the clipping operation implemented by most deep learning frameworks. Compared with another option label smoothing technique, our approach introduces less bias into the model (negligible bias (in the view of training) at finite number of points like but no bias at ). Note that, the effect of on RCE can be reflected by different settings of (refer to Eq. (4.3)).
4.2 Theoretical Analysis
Robustness analysis: In the following, we will prove that the RCE loss is robust to label noise following [3]. We denote the noisy label of as , in contrast to its true label . Given any classifier and loss function , we define the of under clean labels as , and the under label noise rate as . Let and be the global minimizers of and respectively. Risk minimization under a given loss function is noise robust if has the same probability of misclassification as that of on noise free data. When the above is satisfied we also say that the loss function is noisetolerant.
Theorem 1.
In a multiclass classification problem, is noise tolerant under symmetric or uniform label noise if noise rate . And, if , is also noise tolerant under asymmetric or classdependent label noise when noise rate with .
Proof.
For symmetric noise:
where the last equality holds due to following Eq. (5) and definition of . Thus,
because and is a global minimizer of . This proves is also the global minimizer of risk , that is, is noise tolerate.
Similarly, we can prove the case for asymmetric noise, please refer Appendix A for details. ∎
Gradient analysis: We next derive the gradients of a simplified SL with to give a rough idea of how its learning process differs from that of CE^{†}^{†}†Complete derivations can be found in the Appendix B.. For brevity, we denote , as abbreviations for and . Consider the case of a single true label, the gradient of the samplewise RCE loss with respect to the logits can be derived as:
(8) 
where can be further derived based on whether :
(9) 
According to Eq. (9) and the groundtruth distribution for the case of one single label (e.g., , and for ), the gradients of SL can be derived as:
(10) 
where is the smoothed/clipped replacement of . Note that the gradient of samplewise CE loss is:
(11) 
In the case of (), the second term is an adaptive acceleration term based on . Specifically, is a convex parabolic function in the first quadrant for , and has the maximum value at . Considering the learning progresses towards , RCE increases DNN prediction on label with larger acceleration for and smaller acceleration for . In the case of (), the second term is an adaptive acceleration on the minimization of the probability at unlabeled class (), based on the confidence at the labeled class (). Larger leads to larger acceleration, that is, if the network is more confident about its prediction at the labeled class, then the residual probabilities at other unlabeled classes should be reduced faster. When , there is no acceleration, which means if the network is not confident on the labeled class at all, then the label is probably wrong, no acceleration needed.
4.3 Discussion
An easy addition to improve CE would be to upscale its gradients with a larger coefficient (e.g., ‘2CE’, ‘5CE’). However, this will cause more overfitting (see the ‘5CE’ curve in the following Section 5 Figure 8(a)). There are also other options to consider, such as MAE. Although motivated from completely different perspectives, that is, CE and RCE are measures of (information theoretic) uncertainty, while MAE is a measure of distance, we can surprisingly show that MAE is a special case of RCE at , when there is a single true label for (e.g. and ). For MAE, we have,
while, for RCE, we have,
That is, when , RCE is reduced to exactly MAE. Meanwhile, different from the GCE loss (i.e., a weighted MAE) [29], SL is a combination of two symmetrical learning terms.
5 Experiments
We first provide some empirical understanding of our proposed SL approach, then evaluate its robustness against noisy labels on MNIST, CIFAR10, CIFAR100, and a largescale realworld noisy dataset Clothing1M.
Noise setting: We test two types of label noise: symmetric (uniform) noise and asymmetric (classdependent) noise. Symmetric noisy labels are generated by flipping the labels of a given proportion of training samples to one of the other class labels uniformly. Whilst for asymmetric noisy labels, flipping labels only occurs within a specific set of classes [16, 29], for example, for MNIST, flipping , , and ; for CIFAR10, flipping TRUCK AUTOMOBILE, BIRD AIRPLANE, DEER HORSE, CAT DOG; for CIFAR100, the 100 classes are grouped into 20 superclasses with each has 5 subclasses, then flipping between two randomly selected subclasses within each superclass.
5.1 Empirical Understanding of SL
We conduct experiments on CIFAR10 dataset with symmetric noise towards a deeper understanding of SL.
Experimental setup: We use an 8layer CNN with 6 convolutional layers followed by 2 fully connected layers. All networks are trained using SGD with momentum 0.9, weight decay and an initial learning rate of 0.01 which is divided by 10 after 40 and 80 epochs (120 epochs in total). The parameter , and in SL are set to 0.1, 1 and 6 respectively.
Classwise learning: The classwise test accuracy of SL on 40% noisy labels has already been presented in Figure 0(d). Here we provide further results for 60% noisy labels in Figure 5. Under both settings, each class is more sufficiently learned by SL than CE, accompanied by accuracy increases. Particularly for the hard classes (e.g., classes ), SL significantly improves their learning performance. This is because SL facilitates an adaptive pace to encourage learning from hard classes. During learning, samples from easy classes can be quickly learned to have a high probability , while samples from hard classes still have a low probability . SL will balance this discrepancy by increasing the learning speed for samples with while decreasing the learning speed for those with .
Prediction confidence and distribution: In comparison to the low confidence of CE on the clean samples in Figure 3(a), we train the same network using SL under the same setting. As shown in Figure 5(a), on the clean portion of class 3 samples, SL successfully pulls up the confidence to 0.95, while at the same time, pushes down the residual confidence at other classes to almost 0. As further shown in Figure 5(b), the prediction distributions demonstrate that each class contains more than 4000 true positive samples, including the hard classes (e.g., class ). Some classes (e.g., class ) even obtain close to 5000 true positive samples (the ideal case). Compared to the earlier results in Figure 3(b), SL achieves considerable improvement on each class.
Representations: We further investigate the representations learned by SL compared to that learned by CE. We extract the highdimensional representation at the second last dense layer, then project to a 2D embedding using tSNE [14]. The projected representations are illustrated in Figures 2 and 7 for 40% and 60% noisy labels respectively. Under both settings, the representations learned by SL are of significantly better quality than that of CE with more separated and clearly bounded clusters.
Parameter analysis: We tune the parameters of SL: , and . As can be reflected by , here we only show results of and . We tested A in with step 2 and on CIFAR10 under 60% noisy labels. Figure 7(a) shows that large (e.g., 1.0/0.5) tends to cause more overfitting, while small (e.g., 0.1/0.01) can help ease the overfitting of CE. Nevertheless, the convergence can become slow when is too small (e.g., 0.01), a behaviour like the single RCE. For this reason, a relatively large can help convergence on difficult datasets such as CIFAR100. As for parameter , if the overfitting of CE is well controlled by , SL is not sensitive to (Figure 7(b)). However, if CE overfitting is not properly addressed, SL becomes mildly sensitive to (Figure 7(c)).
Ablation study: For a comprehensive understanding of each term in SL, we further conduct a series of ablation experiments on CIFAR10 under 60% noisy labels. Figure 8(a) presents the following experiments: 1) removing the RCE term; 2) removing the CE term; 3) upscaling the CE term; and 4) upscaling the RCE term. We can observe that simply upscaling CE does not help learning, or even leads to more overfitting. The RCE term itself does not exhibit overfitting even when upscaled, but it converges slowly. But when CE and RCE are combined into the SL framework, the performance is drastically improved.
5.2 Robustness to Noisy Labels
Baselines: We compare SL with 5 recently proposed noisy label learning methods as well as the standard CE loss: (1) Forward [16]: Training with label correction by multiplying the network prediction with the ground truth noise matrix; (2) Bootstrap [18]: Training with new labels generated by a convex combination of the raw labels and the predicted labels; (3) GCE [29]: Training with a noise robust loss encompassing both MAE and CE; (4) D2L [13]: Training with subspace dimensionality adapted labels; (5) Label Smoothing Regularization (LSR) [17]: Training with CE on soft labels, rather than the onehot labels; and (6) CE: Training with standard cross entropy loss.
Experimental setup: Experiments are conducted on MNIST [10], CIFAR10 [9] and CIFAR100 [9]. We use a 4layer CNN for MNIST, the same network as Section 5.1 for CIFAR10 and a ResNet44 [7] for CIFAR100. Parameters for the baselines are configured according to their original papers. For our SL, we set for all datasets, and for MNIST, for CIFAR10, for CIFAR100 (a dataset known for hard convergence)^{‡}^{‡}‡For 40% asymmetric noise, is set to 5.0 for CIFAR10 and is set to 2.0 for CIFAR100. Other parameters are unchanged.. All networks are trained using SGD with momentum 0.9, weight decay and an initial learning rate of 0.1. The learning rate is divided by 10 after 10 and 30 epochs for MNIST (50 epochs in total), after 40 and 80 epochs for CIFAR10 (120 epochs in total), and after 80 and 120 epochs for CIFAR100 (150 epochs in total). Simple data augmentation techniques (width/height shift and horizontal flip) are applied on CIFAR10 and CIFAR100. For symmetric noise, we test varying noise rates , while for asymmetric noise, we test noise rates .
Robustness performance: The classification accuracies are reported in Table 1. As can be seen, SL improves on the baselines via a large margin for almost all noise rates and all datasets. Note that Forward sometimes also delivers a relatively good performance, as we directly provide it with the ground truth noise matrix. We also find that SL can be more effective than GCE, particularly for high noise rates. The complete learning procedures of SL and baselines on CIFAR10 are illustrated in Figure 8(b). SL shows a clear advantage over other methods, especially in the later stages of learning with noisy labels. This is likely because that, in the later stages of DNN learning, other methods all suffer to some extent from under learning on hard classes, while SL ensures sufficient learning on them.
Enhancing existing methods with SL: We introduce some general principles to incorporate SL into existing methods to further enhance their performance. For methods that use robust loss functions or label corrections, the RCE term of SL can be directly added to the loss function, while for methods that still use the standard CE loss without label corrections, SL can be used with small and large to replace the existing loss function. This is to avoid overfitting while promote sufficient learning. As a proofofconcept, we conduct experiments to enhance Forward and LSR with SL. For “Forward+SL”, we add the RCE term to the Forward loss with for symmetric/asymmetric noise respectively, while for “LSR+SL”, we use the SL loss with the same setting in Table 1. Results on CIFAR10 are presented in Table 2. Both the enhanced methods demonstrate a clear performance improvement over their original versions (Forward or LSR) both on symmetric and asymmetric noise. However, in some scenarios, the enhanced methods are still not as good as SL. This often occurs when there is a large performance gap between the original methods and SL. We believe that with more adaptive incorporation and careful parameter tuning, SL can be combined with existing approaches to achieve even better performance.
5.3 Experiments on Realworld Noisy Dataset
In the above experiments, we have seen that SL achieves excellent performance on datasets with manually corrupted noisy labels. Next, we assess its applicability for a realworld largescale noisy dataset: Clothing1M [26].
The Clothing1M dataset contains 1 million images of clothing obtained from online shopping websites with 14 classes: Tshirt, Shirt, Knitwear, Chiffon, Sweater, Hoodie, Windbreaker, Jacket, Down Coat, Suit, Shawl, Dress, Vest, and Underwear. The labels are generated by the surrounding text of images and are thus extremely noisy. The overall accuracy of the labels is , with some pairs of classes frequently confused with each other (e.g., Knitwear and Sweater), which may contain both symmetric and asymmetric label noise. The dataset also provides , , manually refined clean data for training, validation and testing respectively, but we did not use the clean data. The classification accuracy on the
clean testing data is used as the evaluation metric.
Experimental setup: We use ResNet50 with ImageNet pretrained weights similar to [16, 26]. For preprocessing, images are resized to , with mean value subtracted and cropped at the center of . We train the models with batch size 64 and initial learning rate , which is reduced by after 5 epochs (10 epochs in total). SGD with a momentum 0.9 and weight decay are adopted as the optimizer. Other settings are the same as Section 5.2.
Results: As shown in Table 3, SL obtains the highest performance compared to the baselines. We also find that Forward achieves a relatively good result, though it requires the use of the part of data that both have noisy and clean labels to obtain the noise transition matrix, which is not often available in realworld settings. SL only requires the noisy data and does not require extra auxiliary information.
6 Conclusions
In this paper, we identified a deficiency of cross entropy (CE) used in DNN learning for noisy labels, in relation to under learning of hard classes. To address this issue, we proposed the Symmetric cross entropy Learning (SL), boosting CE symmetrically with the noise robust Reverse Cross Entropy (RCE), to simultaneously addresses its under learning and overfitting problems. We provided both theoretical and empirical understanding on SL, and demonstrated its effectiveness against various types and rates of label noise on both benchmark and realworld datasets. Overall, due to its simplicity and ease of implementation, we believe SL is a promising loss function for training robust DNNs against noisy labels, and an attractive framework to be used along with other techniques for datasets containing noisy labels.
References
 [1] Devansh Arpit, Stanisaw Jastrzebski, Nicolas Ballas, David Krueger, Emmanuel Bengio, Maxinder S. Kanwal, Tegan Maharaj, Asja Fischer, Aaron Courville, Yoshua Bengio, and Simon LacosteJulien. A closer look at memorization in deep networks. In ICML, 2017.
 [2] Jia Deng, Wei Dong, Richard Socher, Jia Li, Li, Kai Li, and Li FeiFei. Imagenet: A largescale hierarchical image database. In CVPR, 2009.
 [3] Aritra Ghosh, Himanshu Kumar, and PS Sastry. Robust loss functions under label noise for deep neural networks. In AAAI, 2017.
 [4] Jacob Goldberger and Ehud BenReuven. Training deep neuralnetworks using a noise adaptation layer. In ICLR, 2017.
 [5] Bo Han, Jiangchao Yao, Gang Niu, Mingyuan Zhou, Ivor Tsang, Ya Zhang, and Masashi Sugiyama. Masking: A new perspective of noisy supervision. In NeurIPS, 2018.
 [6] Bo Han, Quanming Yao, Xingrui Yu, Gang Niu, Miao Xu, Weihua Hu, Ivor Tsang, and Masashi Sugiyama. Coteaching: robust training deep neural networks with extremely noisy labels. In NeurIPS, 2018.
 [7] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, 2016.
 [8] Lu Jiang, Zhengyuan Zhou, Thomas Leung, LiJia Li, and Li FeiFei. Mentornet: Learning datadriven curriculum for very deep neural networks on corrupted labels. In ICML, 2018.
 [9] Alex Krizhevsky and Geoffrey Hinton. Learning multiple layers of features from tiny images. Technical Report, University of Toronto, 2009.
 [10] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradientbased learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.
 [11] KuangHuei Lee, Xiaodong He, Lei Zhang, and Linjun Yang. Cleannet: Transfer learning for scalable image classifier training with label noise. arXiv preprint arXiv:1711.07131, 2017.
 [12] Yuncheng Li, Jianchao Yang, Yale Song, Liangliang Cao, Jiebo Luo, and Jia Li. Learning from noisy labels with distillation. In ICCV, 2017.
 [13] Xingjun Ma, Yisen Wang, Michael E Houle, Shuo Zhou, Sarah M Erfani, ShuTao Xia, Sudanthi Wijewickrema, and James Bailey. Dimensionalitydriven learning with noisy labels. In ICML, 2018.

[14]
Laurens van der Maaten and Geoffrey Hinton.
Visualizing data using tsne.
Journal of Machine Learning Research
, 9(Nov):2579–2605, 2008.  [15] Eran Malach and Shai ShalevShwartz. Decoupling” when to update” from” how to update”. In NeurIPS, 2017.
 [16] Giorgio Patrini, Alessandro Rozza, Aditya Menon, Richard Nock, and Lizhen Qu. Making neural networks robust to label noise: a loss correction approach. In CVPR, 2017.
 [17] Gabriel Pereyra, George Tucker, Jan Chorowski, Łukasz Kaiser, and Geoffrey Hinton. Regularizing neural networks by penalizing confident output distributions. arXiv preprint arXiv:1701.06548, 2017.
 [18] Scott Reed, Honglak Lee, Dragomir Anguelov, Christian Szegedy, Dumitru Erhan, and Andrew Rabinovich. Training deep neural networks on noisy labels with bootstrapping. arXiv preprint arXiv:1412.6596, 2014.
 [19] Ravid ShwartzZiv and Naftali Tishby. Opening the black box of deep neural networks via information. arXiv preprint arXiv:1703.00810, 2017.
 [20] Sainbayar Sukhbaatar, Joan Bruna, Manohar Paluri, Lubomir Bourdev, and Rob Fergus. Training convolutional networks with noisy labels. arXiv preprint arXiv:1406.2080, 2014.

[21]
Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew
Wojna.
Rethinking the inception architecture for computer vision.
In CVPR, 2016.  [22] Daiki Tanaka, Daiki Ikami, Toshihiko Yamasaki, and Kiyoharu Aizawa. Joint optimization framework for learning with noisy labels. In CVPR, 2018.
 [23] Arash Vahdat. Toward robustness against label noise in training deep discriminative neural networks. In NeurIPS, 2017.
 [24] Andreas Veit, Neil Alldrin, Gal Chechik, Ivan Krasin, Abhinav Gupta, and Serge Belongie. Learning from noisy largescale datasets with minimal supervision. In CVPR, 2017.
 [25] Yisen Wang, Weiyang Liu, Xingjun Ma, James Bailey, Hongyuan Zha, Le Song, and ShuTao Xia. Iterative learning with openset noisy labels. In CVPR, 2018.
 [26] Tong Xiao, Tian Xia, Yi Yang, Chang Huang, and Xiaogang Wang. Learning from massive noisy labeled data for image classification. In CVPR, 2015.
 [27] Xingrui Yu, Bo Han, Jiangchao Yao, Gang Niu, Ivor Tsang, and Masashi Sugiyama. How does disagreement help generalization against label corruption? In ICML, 2019.
 [28] Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals. Understanding deep learning requires rethinking generalization. In ICLR, 2017.
 [29] Zhilu Zhang and Mert R Sabuncu. Generalized cross entropy loss for training deep neural networks with noisy labels. In NeurIPS, 2018.
Appendix A Proof for Theorem 1
Theorem 1.
In a multiclass classification problem, is noise tolerant under symmetric or uniform label noise if noise rate . And, if , is also noise tolerant under asymmetric or classdependent label noise when noise rate with .
Proof.
For symmetric noise:
where the last equality holds due to following Eq. (5) and the definition of (a negative constant). Thus,
because and is a global minimizer of . This proves is also the global minimizer of risk , that is, is noise tolerant.
For asymmetric or classdependent noise, is the probability of a label being correct (i.e., ), and the noise condition generally states that a sample still has the highest probability of being in the correct class , though it has probability of being in an arbitrary noisy (incorrect) class . Considering the noise transition matrix between classes , this condition only requires that the matrix is diagonal dominated by (i.e., the correct class probability ). Following the symmetric case, here we have,
(12) 
As is the minimizer of , . So, from Eq.(12), we have,
(13) 
Next, we prove, holds following Eq. (13). First, as per the assumption that . Since we are given , we have for all . Also, by the definition of , we have , . Thus, for Eq. (13) to hold (e.g. ), it must be the case that , that is, for all , thus which completes the proof. ∎
Comments
There are no comments yet.