R OBUST C URRICULUM L EARNING : FROM CLEAN LABEL DETECTION TO NOISY LABEL SELF - CORRECTION
Anonymous authors
Paper under double-blind review
A BSTRACT
Neural network training can easily overﬁt noisy labels resulting in poor generalization performance.
Existing methods address this problem by (1) ﬁltering out the noisy data and only using the clean data for training or (2) relabeling the noisy data by the model during training or by another model trained only on a clean dataset.
However, the former does not leverage the features’ information of wrongly-labeled data, while the latter may produce wrong pseudo-labels for some data and introduce extra noises.
In this paper, we propose a smooth transition and interplay between these two strategies as a curriculum that selects training samples dynamically.
In particular, we start with learning from clean data and then gradually move to learn noisy-labeled data with pseudo labels produced by a time-ensemble of the model and data augmentations.
Instead of using the instantaneous loss computed at the current step, our data selection is based on the dynamics of both the loss and output consistency for each sample across historical steps and different data augmentations, resulting in more precise detection of both clean labels and correct pseudo labels.
On multiple benchmarks of noisy labels, we show that our curriculum learning strategy can signiﬁcantly improve the test accuracy without any auxiliary model or extra clean data.
I NTRODUCTION
The expressive power and high capacity of deep neural networks (DNNs) result in accurate modeling and promising generalization if provided with sufﬁcient data and clean(correct) labels.
However, recent studies show that the training process is fragile and can easily overﬁt on noisy labels (Zhang et al., 2017), which commonly appear in real-world data since precise annotation is not always available or affordable.
Hence, it is important to study the training dynamics affected by imperfect labels and develop robust learning strategies that ideally eliminate the negative impact of noisy labels while fully exploiting the information from all the available data.
Numerous approaches have been developed to address this challenge from various perspectives, e.g., loss correction (Xiao et al., 2015; Vahdat, 2017; Lee et al., 2018; Veit et al., 2017; Li et al., 2017b), robust loss functions (Ghosh et al., 2017; Zhang & Sabuncu, 2018; Wang et al., 2019; Ma et al., 2020) with provable noise tolerance, sample re-weighting (Patrini et al., 2017), curriculum learning (Kumar et al., 2010; Jiang et al., 2018; Guo et al., 2018), model co-teaching (Han et al., 2018), etc.
A principal methodology behind a variety of methods is to detect clean labels while discard/downweigh the data with wrong labels, so the model mainly learns from correct labels.
A broadly applied criterion is to select the samples with small losses and treat them as clean data.
It is inspired by empirical observations that DNNs learn simple patterns ﬁrst before overﬁtting on the noisy labels (Zhang et al., 2017; Arpit et al., 2017).
Several curriculum learning methods utilize this criterion (Kumar et al., 2010;
Jiang et al., 2014), and in each step, select/upweigh samples with small losses.
Robust loss functions also suppress the large losses associated with the possibly wrong labels.
More recent approaches use mixture models (Arazo et al., 2019) to estimate the distribution of losses for clean and noisy data.
However, the instantaneous loss (i.e., the loss evaluated at the current step) of an individual sample is an unstable signal that can rapidly ﬂuctuate due to DNN training’s randomness.
The error generated by such an unstable metric accumulates when the selected samples are used to train the model producing the losses.
Co-teaching methods alleviate this problem by training two DNNs and using the loss computed on one model to guild the other.
Also, as the model changes during training, each sample’s loss needs to be re-evaluated even when it is not selected, which requires extra inference cost.
MentorNet (Jiang et al., 2018) and Data Parameters (Saxena et al., 2019) train an extra model to produce the sample weights or selection results without computing the loss.
Furthermore, it may not be efﬁcient to repeatedly train the model only on clean data that consistently have small losses, since the model have already learned, well memorized or overﬁtted to them.
A primary drawback of training only on clean labels detected is that discarding the whole data pairs ( x, y ) with wrong labels y removes potentially useful information about the data distribution p ( x ) (Arazo et al., 2019).
Hence, there has been growing interest in leveraging noisy data.
Loss correction methods aim to correct the predicted class probabilities based on an estimated mislabeling probability between classes.
Some other methods seek to relabel them by using the model itself (e.g., bootstrapping loss (Reed et al., 2014)) or another model/mechanism (e.g., directed graphical models, conditional random ﬁelds, or CNNs) trained on an additional set of clean data, which, however, is not always available.
Self-training and unsupervised learning techniques (Rasmus et al., 2015; Berthelot et al., 2019) have also been employed to generate pseudo labels to replace noisy labels (Arazo et al., 2019).
The pseudo labels are optimized together with the model or generated by the model with data augmentations to encourage the output consistency on the same sample’s augmentations.
Unfortunately, the pseudo labels’ quality may vary across different samples and signiﬁcantly degenerate when the noise ratio is high, or the model fails to produce stable and correct predictions.
In such a case, the relabeling error on some samples can be accumulated during training.
In this paper, we address the aforementioned problems of noise-label learning by developing a curriculum learning strategy called Robust Curriculum Learning ( RoCL ) that smoothly transitions between two phases: (1) detection and supervised training on clean data; and (2) relabeling and self-supervision on noisy data.
Speciﬁcally, we train the model for multiple episodes, each starting from phase(1) and gradually moving to phase(2).
Unlike existing approaches, we only select samples with accurate given/pseudo labels that are most informative to the current model training.
Our data selection criterion takes both the dynamics of per-sample loss and output consistency (across multiple data augmentations) into account.
Using an exponential moving average of the loss and consistency over training history, it overcomes the instability of instantaneous losses and does not incur any additional inference cost.
In addition, by adjusting a temperature parameter, the criterion can interpolate between the two phases and keep the training focusing on the data that the model mostly needs to improve on, e.g., clean data with unsatisfying output consistency or wrongly-labeled data with accurate pseudo labels.
Thus, we can fully exploit both clean and noisy data more efﬁciently with less risk of introducing extra noise or error accumulation.
We further show that our data selection can be derived from a novel optimization formulation for robust curriculum learning.
We evaluate our method on multiple noisy learning benchmarks and show that our method outperforms a diverse set of recent noisy-label learning approaches.
1. R ELATED W ORK
Early curriculum learning (CL)
(Khan et al., 2011; Basu & Christensen, 2013; Spitkovsky et al., 2009) seeks an optimized sequence of training samples (i.e., a curriculum, which can be designed by human experts) to improve model performance.
Self-paced learning (SPL)(Kumar et al., 2010; Tang et al., 2012a; Supancic III & Ramanan, 2013;
Tang et al., 2012b) selects easy samples with smaller losses.
It starts with selecting a few samples of small loss and gradually increases the selection size to cover all the training data.
Self-paced curriculum learning (Jiang et al., 2015) combines the human expert in CL and loss-adaptation in SPL.
SPL with diversity (SPLD) (Jiang et al., 2014) applies a negative group sparse regularization to SPL to promote the diversity of selected samples.
Minimax curriculum learning Zhou & Bilmes (2018) promotes the diversity of samples during early learning to encourage exploration and focus on hard samples in later stages.
In the context of robust learning with noisy labels, label correction methods aim to identify the wrong labels and possibly correct them to get more consistent labels for training.
Previous work often apply an extra noise model (directed graphical model (Xiao et al., 2015), conditional random ﬁelds (Vahdat, 2017), neural network (Lee et al., 2018; Veit et al., 2017), knowledge graph (Li et al., 2017b)) to correct the noisy labels, which often require extra clean data and as well as training/inference of the noise model.
Another line of research focuses on loss correction, which modiﬁes the loss or prediction probabilities during training to correct the misinformation from the noisy labels.
Patrini et al.
(2017) uses two noise transition (backward and forward) matrices to correct the prediction probabilities.
Label
Smoothing Regularization (Szegedy et al., 2016; Pereyra et al., 2017) alleviates the overﬁtting to noisy labels by using soft labels instead of one-hot labels.
Reed et al.
(2014) augments the loss with a notion of perceptual consistency.
Jiang et al.
(2018) trains a mentor network to reweigh samples duri‘ng the training of a student network.
Guo et al.
(2018) designs a curriculum by ranking the complexity of data using its distribution density in a feature space.
Ren et al.
(2018) proposes a meta-learning algorithm that learns to assign weights to samples based on their gradients in training compared to those of validation data, which requires extra clean data.
Co-teaching (Han et al., 2018) feeds in the network with the most conﬁdent samples of another network to reduce conﬁrmation bias. Amid et al.
(2019) generalizes the logistic loss and the exponents in the softmax by applying a temperature to each of them and makes the training more robust to noise.
Hu et al.
(2019) trains a network on noisy labels in the weakly supervised setting and uses it as a regularization term to improve the training on clean data.
Some approaches focus on designing loss functions that have robust behaviors and provable tolerance to label noise.
Ghosh et al.
(2017) theoretically proves that the Mean Absolute Error(MAE) is a robust loss.
The Generalized Cross Entropy (Zhang & Sabuncu, 2018) uses a negative Box-Cox transformation to obtain a loss function that generalizes MAE and Cross Entropy loss.
Wang et al.
(2019) proposes a Symmetric Cross Entropy that combines Cross Entropy loss and Reverse Cross
Entropy loss.
Ma et al.
(2020) proposes a loss normalization method and shows that any loss can be made robust to noisy labels.
RoCL shares similar ideas with some CL methods in that RoCL starts with learning easy and clean samples and gradually moves to hard and noisy ones.
RoCL is more related to the loss correction approach in noisy-label learning literature as RoCL generates a curriculum dynamically assigning weight (probability) to each sample.
RoCL differs from existing methods in: (1) it only selects a subset of informative and reliable labels for training in each epoch; (2) it is a smooth transition not only from clean data to noisy data but also from supervised learning to self-supervision; (3) it runs multiple episodes of the curriculum to avoid getting in a local minimum dominated by a small set of clean/noisy data or a speciﬁc type of loss; (4) it does not assume the availability of an extra set of clean data; (5) it does not require extra computation or any modiﬁcation to the model.
D YNAMIC P ATTERNS OF C LEAN /N OISY L ABELS IN T RAINING 2. L OSS D YNAMICS AND C LEAN L ABEL D ETECTION
A key challenge for most noise-label learning methods is to design a reliable criterion to select/reweigh clean data and distinguish them from the noisy data, so all the clean data can be fully exploited while most noisy labels are ﬁltered out of the training process.
Loss computed at an instantaneous step have been widely used for this purpose according to the observation that the loss on clean data is usually smaller than noisy data.
One important reason is that the clean labels are mutually consistent with each other in producing gradient updates, and therefore, the model can ﬁt them better and faster.
On the other hand, the noisy labels may contain mutually inconsistent information, creating a form of long-lasting “tug of war” amongst themselves.
For example, it can be hard for the model to ﬁnd consistent visual patterns from images with noisy labels to make the desired predictions.
However, instantaneous loss suffers from high variance across training epochs (as shown in the ﬁrst plot of Figure 1) and is inaccurate for clean data detection under high noise ratio (i.e., the proportion of wrong labels is high) and the randomness of DNN training, e.g., random initialization, random data augmentation, etc.
Moreover, it needs to evaluate the instantaneous loss for all samples in each step, resulting in extra inference cost on unselected samples.
The dynamic patterns of losses over the course of training give us a new insight for better clean data detection even when the noise ratio (proportion of wrong labels) is high.
In particular, we hypothesize that a sample’s label is more likely to be correct if its losses persistently retain low values over training steps.
Given a sample ( x i , y i ) with x i being the features and y i being the label, we describe its loss dynamics using a simple exponential moving average (EMA) of the instantaneous loss (cid:96) ( f ( x i ; θ t ) , y i ) (where f ( x i ; θ t ) denotes the model output and θ t is the model parameters at step t ∗ along the training history, which is deﬁned and computed recursively as
[Equation]
Where γ ∈ [0 , 1] is a discounting factor, V is the set of all n training samples, and S t ⊆
V is the set of samples selected (by a certain curriculum) for training at epoch t .
We only update the EMA loss for selected samples using the byproduct l t ( i ) of training without requiring extra inference.
In the ﬁrst and the third plots of Figure 1, we show how the losses and EMA losses associated with clean/noisy data change throughout the training process.
Speciﬁcally, we train a ResNet34 (He et al., 2016) model on CIFAR10 with 60% of the original labels randomly changed to a wrong class.
To avoid quick overﬁtting to the noise, we train the model for multiple episodes (each composed of several epochs over all data with a cosine annealing learning rate) and alternate between the supervised learning episode that minimizes the cross-entropy loss against the given noisy labels and the self-supervision episode that minimizes the consistency loss Eq.(2) against the pseudo labels.
Comparing the shaded areas (std) of instantaneous loss and EMA loss and the gap between curves in the two plots, we see that EMA leads to smaller variance within each group and larger gap between the clean and noisy groups, demonstrating the effectiveness of EMA loss for clean data detection.
2. C ONSISTENCY D YNAMICS AND P SEUDO L ABEL S ELECTION
Simply removing noisy data ( x, y ) with wrong label y discards important information about the data distribution p ( x ) (Arazo et al., 2019).
Including all the noisy data for self-supervision, bootstrapping or relabeling can also harm the training since the pseudo labels’ quality is not equal across samples and much depends on the model generating them, where the model’s predictions may contain errors that can accumulate if adopted for training.
Hence, a careful selection of noisy data is necessary.
However, without access to a purely clean dataset or a reliable pre-trained model, it is nontrivial to evaluate pseudo labels’ correctness.
By analyzing the training dynamics of model outputs in the above experiment, we discover that the model output for a sample tends to be an accurate pseudo label if the output remains consistent over training steps and across different augmentations of the sample.
We ﬁrst deﬁne the instantaneous consistency loss of a sample x i at step t as the discrepancy of the model output f ( x i ; θ ) between step t and t − 1 on x i and its m data augmentations { x ( j ) i } mj =1 , where the discrepancy can be measured by any loss function (cid:96) ( · , · ) .
However, the discrepancy can be small if the models of epoch t and t − 1 are too similar and make the same errors.
Therefore, we use an exponential moving average of the model parameters (according to mean teacher (Tarvainen & Valpola, 2017)) and compute the prediction at step t − 1 by averaging over multiple data augmentations (according to MixMatch (Berthelot et al., 2019)): f t ( x i ) (cid:44) 1 / m (cid:80) m j =1 f
( x ( j ) i ; θ t ) , θ t (cid:44) γθ t − 1 + (1 − γ ) θ t − 1 .
Computing pseudo labels on augmented data and a time averaging ensemble of models is commonly-adopted for semi-supervised learning (Sajjadi et al., 2016; Laine & Aila, 2016;
Zhou et al., 2020).
The instantaneous consistency loss † ζ t ( i ) of sample x i at step t is then deﬁned as
[Equation]
Which can also be minimized as a consistency loss for x i in self-supervised learning when no label is given.
Similar to the EMA loss in Eq.
(1), we deﬁne the EMA consistency loss over training history
[Equation]
Note we use the same γ value as in Eq. The EMA consistency loss c t ( i ) measures both the time-consistency over multiple training steps and the spatial consistency over different augmentations of sample x i .
If the output prediction is wrong and contradicts other samples’ labels, it will be inconsistent over time and across augmentations since it can easily change or ﬂip after the next training step.
In the last plot of Figure 1, we report the mean and standard deviation (the middle line and the shaded area) of the EMA consistency loss for two groups of data at each epoch, i.e., the ones with correct pseudo labels and the ones with incorrect pseudo labels.
Comparing to the instantaneous consistency loss in the second plot, EMA consistency loss is a more reliable criterion for allocating correct pseudo labels.
Thus, we can safely learn the noisy data by using their pseudo labels as training targets and avoid introducing harmful noises.
R OBUST C URRICULUM L EARNING
In this section, we ﬁrst introduce the selection criterion for both the clean label detection and pseudo label selection.
By adjusting two temperature parameters τ 1 and τ 2 , it can smoothly interpolate between the two criteria and control their trade-off.
We then show that the criterion is derived from a novel optimization formulation for robust curriculum learning.
We ﬁnally present the RoCL algorithm.
3. D ATA S ELECTION C RITERION
To combine of clean label detection and pseudo label selection, we use the two criteria from the previous sections and apply a temperature parameter to control the preference for small/large loss or consistency loss and their trade-off.
We sample x
i at training step t with probability:
[Equation]
where p t ( i ) and q t ( i ) are deﬁned as softmax probabilities, i.e.,
[Equation]
and λ ∈ [0 , 1] controls trade-off between them.
Here, p t ( i ) is a softmax probability computed from
EMA losses for clean data detection: samples with smaller (larger) EMA losses and thus clean (noisy) labels tend to have high probability p t ( i ) when τ 1 is negative (positive).
Similarly, q t ( i ) is computed from EMA consistency loss for pseudo label selection: samples with smaller (larger) EMA consistency loss and thus correct (wrong) pseudo labels tend to have high probability q t ( i ) when τ 2 is negative (positive).
When τ 1 , τ 2 = 0 , the probabilities are uniform, and when τ 1 , τ 2 → + ∞ / −∞ , the probabilities approximate the max (min) operator.
Either p t ( i ) or q t ( i ) can be independently employed to select or reweigh samples for noise-label learning.
However, selecting samples with high probabilities p t ( i ) when τ 1 (cid:28) 0 tends to make the training focus on clean data that the model has already learned, which carries limited new information and prevents exploration.
Similarly, selecting samples with high probabilities q t ( i ) when τ 2 (cid:28) 0 is not informative since the model outputs are consistently correct for those data, and little progress can be made.
We can encourage exploration by manipulating the temperature parameters.
By setting τand τ 2 close to zero, we move towards uniform exploration of all data.
A more effective strategy is to couple the values of τ 1 and τ 2 .
For example, a negative τ 1 and a positive τ 2 strengthen the preference for clean data that have not been fully exploited and learned by the model.
Alternatively, a positive τwith a negative τ 2 emphasizes the noisy data with correct pseudo labels, so relabeling them provides new information in addition to the clean data.
We apply the data selection criterion of Eq.
(4) in each step and gradually change its parameters ( τ 1 , τ 2 , λ ) over the course of training according to the properties discussed above.
We start from a negative τ 1 associated with a positive τ 2 and a large λ ( p t ( i ) dominates), then gradually increase τ 1 while decrease τ 2 and λ , and end with a positive τ 1 , a negative τ 2 and a small λ .
In this way, we get a curriculum with a smooth transition between supervised learning of clean data using correct given labels and self-supervision of noisy data using reliable pseudo labels (i.e., minimizing Eq.
Moreover, the coupling strategy on τ 1 and τ 2 encourages selecting informative samples that the model mostly needs to improve on, i.e., clean data with inconsistent model outputs or noisy data with correct pseudo labels.
In our experiments, we can further reduce the hyperparameters: (1) given the sequence for τ 1 in the curriculum as τ 1: T , we can reverse it as the sequence for τ 2 , i.e., τ T :1 ; (2) we can make λ monotone increase with τ 1 , e.g., setting the initial value λ 1 = aτ 1 + b and ending value λ T = aτ T + b , solving this linear system for a and b , which generate λ 1: T = aτ 1: T + b .
3. R OBUST C URRICULUM L EARNING AS AN O PTIMIZATION
The data selection criterion is derived from an optimization formulation of our robust curriculum learning (RoCL), in which we aim to minimize a combination of supervised loss and
[Equation]
where the consistency loss ζ ( i ) is deﬁned in Eq.
(2) (with t removed).
For the ﬁrst term of Eq. (6), unlike the conventional empirical risk minimization (ERM) with arithmetic average loss, i.e.,/ n
[Equation] ni =1 (cid:96) ( f ( x i ; θ ) , y i ) , we use LogSumExp loss with an additional temperature parameter (i.e.,τ 1 log (cid:0) 1 n (cid:80) ni =1 exp[ τ 1 (cid:96) ( f ( x i ; θ ) , y i )] (cid:1) ), so it can approximate both the min-loss (when τ 1 → −∞ ), max-loss (when τ 1 → + ∞ ), and any interpolation between them, where the min-loss focuses on the easiest samples with the smallest losses and the max-loss focuses on the hardest ones.
Note it reduces to the arithmetic average loss when τ → 0 .
It is called “tilted loss” in a recent work (Li et al., 2020), which shows several intriguing properties in different learning settings. The second term of Eq.
(6) focuses on the consistency loss ζ ( i ) . We use λ to control the trade-off between the supervised loss and the consistency loss.
By simple algebra, the gradient of F ( θ ) at step t is ∇
[Equation]
where
[Equation]
Here [Equation] p (cid:48) t ( i ) and q (cid:48) t ( i ) are similar to p t ( i ) and q t ( i ) deﬁned in Eq. (5) except that the EMA loss and
EMA consistency loss are replaced by their instantaneous counterparts respectively, i [Equation] e., p (cid:48) t ( i ) (cid:44)
[Equation]
Similarly, we also denote [Equation] t ( i ) . Note in Section 2, we already discussed that the EMA metrics are better alternatives to the instantaneous metrics when used for data selection in noisy-label learning.
In our experiments, we use the EMA metrics { p t ( i ) , q t ( i ) , P t ( i ) } instead of the instantaneous ones { p (cid:48) t ( i ) , q (cid:48) t ( i ) , P (cid:48) t ( i ) } .
For every training step, an unbiased estimator of the gradient in Eq.
(7) can be achieved by drawing a subset of samples S t according to P t ( i ) and averaging their gradients G t ( i ) in Eq.
3. R OBUST C URRICULUM L EARNING A LGORITHM
1: input: { ( x i , y i ) } ni =1 , h ( · ; η ) , (cid:96) ( · , · ) , f ( · ; θ ) , T 0: K ; τ 1 < 0 , τ T > 0 ; λ 1 , λ T ∈ [0 , 1] ; γ, γ b ∈ [0 , 1] 2: initialize: θ 0 , b 0 ∈ (0 , n ) , l 0 ( i ) =
c
( i ) = 0 ∀ i ∈ [ n ] 3: for k ∈ { 0 , · · · , K } do 4:
Schedule τ 1: T k and λ 1: T k by Eq.
(9)-(10); 5: for t (cid:48) ∈ { 1 , · · · , T k } do 6: t ← t (cid:48)
+ T k − 1 ; 7: if k = 0 then 8:
S t ← [ n ] ; 9: θ t ← θ t − 1 + h (cid:0) ∇ θ 1 n (cid:80) ni =0 (cid:96) t ( i ); η (cid:1) ; 10: else 11:
Draw a subset S t ⊆ [ n ] of b k samples according to probability P t in Eq.
(4) with τ 1 = τ t (cid:48) , τ 2 =
τ T k − t (cid:48) , λ = λ t (cid:48) ; 12: θ t ← θ t − 1 + h (cid:16) {+
+} b k (cid:80) i ∈
S t G t ( i ); η (cid:17) (Eq.
(8)); 13: end if 14:
Update l t +1 ( i ) and c t +1 ( i ) by Eq.
(1) and Eq.
(3); 15: end for 16: b k +1 ← (1 + γ b ) × b k ; 17: end for
We describe our curriculum learning algorithm RoCL in Alg.
1 based on the data selection criterion in Section 3.1 and the optimization formulation in Section 3.2.
We denote the update of θ t produced by the adopted optimizer as h ( ∇ θ F ( θ t ) , η ) , where η contains all hyperparameters of the optimizer at step t , e.g., the learning rate.
We denote (cid:96) t ( i ) as a shorthand notation for (cid:96) ( f ( x i ; θ t − 1 ) , y i ) .
We apply a warm starting episode of a few epochs (e.g., 5-10) over all the data and given labels with label smoothing to obtain stable EMA metrics.
After that, we apply multiple episodes of curriculum learning, each including a sequence of steps following the curriculum at the end of Section 3.1 for data selection per step (Line 6-14).
We repeat the transition between clean data learning to noisy data learning for K episodes to avoid getting trapped in a local minimum dominated by a small set of clean/noisy data or a speciﬁc type of loss.
It also reinforces the memorization of clean labels and correct pseudo labels learned in previous episodes.
Moreover, under the coupling strategy of τ 1 and τ 2 , each episode is encouraged to explore the clean/noisy data that the previous episode fails to learn.
Considering the undertrained model (producing inaccurate pseudo labels) and the relatively high variance of the EMA metrics at the earlier episodes, we start from a small budget for the selected subset size and gradually increase in later episodes.
To generate the whole schedule of τ 1: T in each episode, we can apply any monotone interpolation between τ 1 and τ T whose values are predeﬁned. Let g : R (cid:55)→ [ − σ, σ ] be an invertible monotone continuous function. We deﬁne the interpolation between τ 1 and τ T as follows, ∀ t ∈ [ T ] ,
[Equation]
Note the g ( σ t ) produces interpolation values between [ − σ, σ ] that correspond to T evenly spaced input σ t ∈ [ g − 1 ( − σ ) , g − 1 ( σ )] .
In our curriculum for each episode, we need to keep a high quality of the selected clean (pseudo) labels in earlier (later) stages and make the exploration stages in between shorter since their selected labels contain more noise.
Therefore, we choose “s”-shaped functions such as tanh or the logistic function for the interpolation.
In this paper, we use g ( · ) = tanh( · ) and pick σ = 0 .
We illustrate Eq.
(9) and visualize our choice of g ( · ) and the resulting τ t in Figure(Appendix).
The corresponding schedule for λ can then be deﬁned as an afﬁne transformation of τ 1: T :
[Equation]
[Table] We evaluate RoCL with other approaches for noisylabel learning on three widely used benchmarks, i.e.,
CIFAR10/100 with two types of synthetic noises (i.e., symmetric and asymmetric), and mini-WebVision (Li et al., 2017a) (the ﬁrst 50 classes) containing unknown noises from web labels. Symmetric noise ﬂips each label randomly to an incorrect class with probability ρ (i.e., noise rate), and our experiments cover ρ = { 0 . 4 , 0 .
Asymmetric noise ﬂips the labels within a speciﬁc set of classes. For CIFAR10, ﬂipping
TRUCK → AUTOMOBILE, BIRD → AIRPLANE, DEER → HORSE, CAT → DOG. In CIFAR100, theclasses are grouped into 20 super-classes with each has 5 sub-classes, we then ﬂip each class within the same super-class to the next in a circular fashion with prob ability ρ . Our experiments cover ρ = { 0 . 2 , 0 . 3 , 0 . 4 } .
Practical Modiﬁcations In the experiments, we follow previous work and apply the techniques below.
We will present an ablation study of their effectiveness in Table 5. • We apply the class-balance regularization used in (Tanaka et al., 2018), which prevents the model from predicting the same class for all the samples within a mini-batch B .
We add ( 1 / B ) (cid:80) i ∈ B (cid:96) ( f ( x i ; θ ) , 1 / C · 1 ) (where C is the number of classes) to the objective for a mini-batch B with regularization weight of 1 .
We apply label smoothing whose effectiveness in noisy-label learning has been studied in (Lukasik et al., 2020).
We modify each one-hot label y i to be ¯
y i ← (1 − α )
y i + α / C
(e.g., we use α = 0 . 5 ).
• We apply Mix-Up (Zhang et al., 2018) to all the selected data.
However, Mix-Up of two (soft) pseudo labels can signiﬁcantly increase the entropy of the mixed label if both pseudo labels are under-conﬁdent.
Hence, we apply a curriculum to the beta distribution’s parameter α of Mix-Up and gradually reduce it (e.g., from 8 . 0 to 0 .
2 in our experiments) within each episode.
Hyperparameter Setting We apply RoCL to train ResNet34 on CIFAR10/100 and ResNet50 on
WebVision, which are the most widely used models in other baseline papers.
We apply SGD with momentum of 0.9, weight decay of 10 − 4 and cosine annealing learning rate in each training episode.
The initial learning rate is set to 0.1 for CIFAR10/100 and 1.0 for WebVision.
In all RoCL experiments, we apply T 0 = 10 warm starting epochs followed by K = 10 episodes of curriculum learning, whose lengths start from T 1 = 10 and increase by 10 for every episode afterwards.
We initialize the subset size b 0 = 0 .
2 n and set γ = γ b = 0 . 1 , which are common choices for discounting/augmenting factors.
We use Cubuk et al.
(2020) for data augmentations.
We did not heavily tune λ 1 , λ T and τ 1 , τ T and followed a principle that the resulting curriculum should have a transition from supervised learning on clean data to self-supervised learning on noisy data with correct pseudo labels.
• For λ , we start from λ 1 close to 1 and end with λ T close to 0 because our curriculum is a transition from supervised learning ( λ = 1 ) to self-supervised learning ( λ = 0 ).
• As explained in Section 3.1, our curriculum requires τ 1 for p t ( i ) changing from negative to positive values and an inverse sequence for τ 2 in q t ( i ) to gain the above transition and encourage learning on more informative samples.
Hence, we set the starting value τ 1 to be negative and τ T to be positive for the sequence τ 1: T . • We set their exact values based on observations in Figure 1: clean data detection is easier but the detection of correct pseudo-labels is harder. So we can be more conﬁdent on the former than the latter and set the starting τ 1 larger than τ T in magnitude. For the same reason, we set the starting value λ 1 to be closer to 1 than the ending value
λ T to 0.
In experiments, we tried τ 1 = {− 4 , − 3 } and τ T = { 1 , 2 } and ﬁnally chose τ 1 = − 4 and τ T = 1 since this choice performs consistently well on all experiments, though it might not be the best choice for all; we set λ 1 = 0 .
and did not try other values; we tried λ T = { 0 . 1 , 0 . 2 , 0 . 3 } and on some experiments the ﬁrst two choices lead to slightly worse performance, so we chose λ T = 0 . 3 .
[Table]
We compare RoCL to the following baselines: Fcorrect (Patrini et al., 2017), Decoupling (Malach & Shalev-Shwartz, 2017), Co-teaching (Han et al., 2018), D2L (Ma et al., 2018), INCV (Chen et al., 2019), MDDYR-SH (Arazo et al., 2019), MentorNet (Jiang et al., 2018), MentorMix (Jiang et al., 2020), O2U-net (Huang et al., 2019), RoG+D2L (Lee et al., 2019), PENCIL (Yi &
Wu, 2019), GCE (Zhang & Sabuncu, 2018), SCE (Wang et al., 2019), NFL/NCE variants (Ma et al., 2020), and Bootstrap (Reed et al., 2014).
To better compare and categorize different baseline methods, we use the following symbols to denote the techniques used: + for additional clean training data; ∗ for training additional auxiliary models; ‡ for using mixup; (cid:63) for using data augmentations; † for class-balance regularization; (cid:111) for label-smoothing.
We report the results and comparisons to baselines in three tables: real-world noise in Table.
1, symmetric noise in Table.
3 and asymmetric noise in Table.
RoCL achieves the best performance in every setting, and for most of the cases, improves upon the existing methods by large margins.
The closest rival to RoCL is MentorMix, which utilizes MentorNet and Mix-Up to assign weights to each sample.
We note that MentorMix requires training of an extra mentor network to generate the sample weights, while RoCL is more ﬂexible and only makes changes to the training process without modifying the model.
Table.
2 reports RoCL’s performance when applied with different loss functions on
[Table] [Table]
CIFAR10 under high noise rates, i [Table] e., 60% and 80%.
We observe signiﬁcant improvements over their performance without using RoCL in Table.
It indicates that RoCL is compatible with any loss function and can further enhance their performance [Table] [Table] To analyze the effect of each component in RoCL
[Table] we conduct a thorough ablation study of 10 variants of RoCL, each removing/changing one component of the original RoCL. In Table [Table]
we report their test accuracies on CIFAR10/100 with noise rates of { 60% , 80% } . In Figure 7-10 in Appendix, we report how their test accuracies change during the training to study their learning efﬁciency and convergence. Among them, “no ClassBalance” removes the class-balance regularization; “no RandAugment” replaces the strong data augmentation RandAugment Cubuk et al.
(2020) with random crop and random horizontal ﬂip; “no RandSampling” replaces the weighted sampling in Line 11 of Algorithm 1 by selecting the top- b k samples with the largest P t ( i ) ; “no EMA metrics” replaces EMA loss and EMA consistency loss with their instantaneous counterparts; “ p t ( i ) = 1 /n ” samples the clean data using uniform probabilities; “ q t ( i ) = 1 /n ” samples the correct pseudo-labels using uniform probabilities; “ p t ( i ) =
q t ( i ) = 1 /n ” uses uniform probabilities for both. Note for the ﬁnal three variants, we still have the curriculum of λ . We keep the same hyperparameter settings as the original RoCL. We give brief conclusions here and leave a detailed analysis to Appendix: (1)
Except
RoCL Base in Algorithm 2, “no RandAugment” and “no ClassBalance”, most variants perform similarly as the original RoCL and outperform the previous SoTA achieved by MentorMix.
The removed components are more important under higher noise rates.
(2) RoCL Base removes our proposed curriculum and preserves all other techniques but shows signiﬁcant degradation on accuracies, indicating that the curriculum is essential to RoCL’s appealing performance.
A strong data augmentation is critical to effective self-supervision and accurate EMA consistency loss estimation in RoCL, while a weak one may lead to error accumulation.
However, applying RandAugment in MentorMix degrades its original performance. (4) Class-balance regularization is only important under very high noise rates. (5) Removing Mix-Up can improve RoCL’s performance since it damages information when mixing soft pseudo labels. (6) Compared to other variants, “no RandSampling” or “no EMA metrics” causes less degeneration on the ﬁnal accuracies but can slow down the convergence and learning speed in the early stages when exploration is insufﬁcient.
(7) Changing p t ( i ) , q t ( i ) or both to uniform probabilities reduces the ﬁnal accuracies in all cases and signiﬁcantly slows down the learning process.
C ONCLUSION
We propose a novel curriculum learning method RoCL for robust learning under label noises.
[-c 
 ( i ) = 0 ∀ i ∈ [ n ] 3: for k ∈ { 0 , · · · , K } do 4: for t (cid:48) ∈ { 1 , · · · , T k } do 5: t ← t (cid:48)-]RoCL features a smooth transition from learning with clean data to noisy data, and from learning with supervised loss to self-supervised loss.
[-+ T k − 1 ; 6: S t ← [ n ] ; 7: if k %2 = 0 then 8: θ t ← θ t − 1 + π (cid:0) ∇ θ 1 n (cid:80) ni =0 (cid:96) t ( i ); η (cid:1) ; {supervised learning using given labels} 9: Update l t +1 ( i ) by Eq. (1); {update EMA loss} 10: else 11: θ t ← θ t − 1 + π (cid:0) ∇ θ 1 n (cid:80) ni =
-]Based on observations of training dynamics, RoCL can select samples with reliable labels/pseudo labels and most informative to training.
RoCL does not require availability of extra clean data or training of extra auxiliary models. On multiple benchmarks of noisy label learning, RoCL signiﬁcantly improves upon existing baselines.
A. A DDITIONAL E XPERIMENTS
[Figure] [Figure] [Figure] [Figure]
[Figure]
[Table]
PENCIL - - - 69 .
12 ±
[Table]
[Table]
79 ±
[Table]
[Table]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
t e s t a cc u r a c y
[Figure]
[Figure]
t e s t a cc u r a c y ( % )
[Figure]
We present a more detailed analysis of the ablation study results with explanations of the observed phenomenons below. • Most variants (except RoCL Base , no RandAugment, and no ClassBalance) have similar performance as the original RoCL and perform better than or competitive with the SoTA results achieved by MentorMix. The differences compared to original RoCL become smaller under the lower noise rate setting (60%). RoCL Base uses all data for training in each step without applying any curriculum, showing that our proposed curriculum is the most critical component of RoCL in achieving the appealing improvements.
Note RoCL Base already outperforms most methods in Table 3, which veriﬁes the effectiveness of multi-episode training that alternates between supervised learning with the given labels and self-supervision with the pseudo labels.
• Removing RandAugment degrades the performance, especially when the noise rate is very high (e.g., 80%) because strong data augmentations are required by the self-supervision and the EMA consistency loss in RoCL, while trivial data augmentations can result in error accumulation or over-conﬁdence in pseudo labels and inaccurate EMA consistency loss.
The self-supervision aims to encourage the model output consistency over different augmentations of the same sample.
Without augmentations with sufﬁcient variations, self-supervision reduces to reinforcing the same outputs on similar samples and thus carries little information and can even magnify/accumulate errors (if any) in the original outputs.
Also, the EMA consistency loss cannot generate meaningful consistency measures if computed on the same data or its trivial augmentations.
Note a strong data augmentation is not always beneﬁcial in all noisy label learning methods since it can increase the uncertainty in the presence of wrong labels, making the detection of clean data and noise correction more challenging.
For example, we tried applying RandAugment to MentorMix (using
the ofﬁcial implementations of both) but observed inferior performance compared to the results using its original data augmentations.
• Class balance regularization is useful for the very high noise rate setting (80%), in which a wrong label may dominate the learning on a mini-batch by a large chance.
However, when the noise rate is not that high (e.g., 60% on CIFAR10), removing it results in better performance.
• Although Mix-Up has been proved effective in previous methods, and for this reason, we followed MentorMix by starting with a relatively strong Mix-Up ( alpha = 8 . 0 ) and then gradually reducing it to α = 0 .
In the ablation study, we ﬁnd that completely removing Mix-Up signiﬁcantly improves performance.
Mix-Up is helpful when applied to mix a clean label with a noisy label since the latter can be mediated with the former and thus softened.
However, this is rarely the case for RoCL since RoCL either mainly learns from clean data or wrongly-labeled data with correct pseudo labels, and the transition between the two phases is short.
When applied to two correct labels/pseudo labels, Mix-Up weakens each label’s conﬁdence, and we may lose information from the inter-class probabilities in the soft pseudo labels.
• Replacing weighted sampling with top-k selection (“no RandSampling”) or replacing EMA metrics with instantaneous metrics (“no EMA metrics”) causes less degeneration on the ﬁnal test accuracies.
However, they are important to the early-stage exploration and accurate estimation of EMA metrics on less-visited samples.
In Figure 7-10, these two variants usually suffer from low accuracy and convergence speed during early stages.
The only exception is “no RandSampling” in Figure 10, which performs better than the original RoCL.
A possible reason is that the randomness brought by high uniform label noises already bring sufﬁcient randomness for exploration.
• Replacing p t ( i ) , q t ( i ) or both with uniform probabilities over all samples reduces the ﬁnal test accuracies in all cases, e.g., the degradation is signiﬁcant on CIFAR100 with
80% noise. In Figure 7-10, we can see that by setting q t ( i ) =
1 /n results in less degradation than the other two.
This is due to the more accurate pseudo labels generated for more data (even the ones with larger
EMA consistency loss) as training proceeds.
Moreover, since we are conservative in setting λ T and τ T , the performance is not very sensitive to wrong pseudo labels.