DivideMix
Code for paper: DivideMix: Learning with Noisy Labels as Semi-supervised Learning
view repo
Deep neural networks are known to be annotation-hungry. Numerous efforts have been devoted to reducing the annotation cost when learning with deep networks. Two prominent directions include learning with noisy labels and semi-supervised learning by exploiting unlabeled data. In this work, we propose DivideMix, a novel framework for learning with noisy labels by leveraging semi-supervised learning techniques. In particular, DivideMix models the per-sample loss distribution with a mixture model to dynamically divide the training data into a labeled set with clean samples and an unlabeled set with noisy samples, and trains the model on both the labeled and unlabeled data in a semi-supervised manner. To avoid confirmation bias, we simultaneously train two diverged networks where each network uses the dataset division from the other network. During the semi-supervised training phase, we improve the MixMatch strategy by performing label co-refinement and label co-guessing on labeled and unlabeled samples, respectively. Experiments on multiple benchmark datasets demonstrate substantial improvements over state-of-the-art methods. Code is available at https://github.com/LiJunnan1992/DivideMix .
READ FULL TEXT VIEW PDF
In this work, we propose a simple yet effective semi-supervised learning...
read it
Semi-supervised learning algorithms reduce the high cost of acquiring la...
read it
We present label gradient alignment, a novel algorithm for semi-supervis...
read it
Semi-supervised learning is becoming increasingly important because it c...
read it
Noisy labeled data represent a rich source of information that often are...
read it
Label information plays an important role in supervised hyperspectral im...
read it
This paper proposes a novel training scheme for fast matching models in
...
read it
Code for paper: DivideMix: Learning with Noisy Labels as Semi-supervised Learning
The remarkable success in training deep neural networks (DNNs) is largely attributed to the collection of large datasets with human annotated labels. However, it is extremely expensive and time-consuming to label extensive data with high-quality annotations. On the other hand, there exist alternative and inexpensive methods for mining large-scale data with labels, such as querying commercial search engines (webvision), downloading social media images with tags (Mahajan_ECCV_2018), leveraging machine-generated labels (OpenImages), or using a single annotator to label each sample (Tanno_2019_CVPR). These alternative methods inevitably yield samples with noisy labels. A recent study (Zhang_ICLR_2017) shows that DNNs can easily overfit to noisy labels and results in poor generalization performance.
Existing methods on learning with noisy labels (LNL) primarily take a loss correction approach. Some methods estimate the noise transition matrix and use it to correct the loss function
(Giorgio_CVPR_2017; Goldberger_ICLR_2017). However, correctly estimating the noise transition matrix is challenging. Some methods leverage the predictions from DNNs to correct labels and modify the loss accordingly (Reed_2015_ICLR; Tanaka_CVPR_2018). These methods do not perform well under high noise ratio as the predictions from DNNs would dominate training and cause overfitting. To overcome this, Arazo_ICML_2019 adopt (mixup) augmentation. Another approach selects or reweights samples so that noisy samples contribute less to the loss (Jiang_ICML_2018; Ren_ICML_2018). A challenging issue is to design a reliable criteria to select clean samples. It has been shown that DNNs tend to learn simple patterns first before fitting label noise (Arpit_ICML_2017). Therefore, many methods treat samples with small loss as clean ones (Jiang_ICML_2018; Arazo_ICML_2019). Among those methods, Co-teaching (co-teaching) and Co-teaching (Yu_ICML_2019) train two networks where each network selects small-loss samples in a mini-batch to train the other.Another active area of research that also aims to reduce annotation cost is semi-supervised learning (SSL). In SSL, the training data consists of unlabeled samples in addition to the labeled samples. Significant progress has been made in leveraging unlabeled samples by enforcing the model to produce low entropy predictions on unlabeled data (Grandvalet_NIPS_2005) or consistent predictions on perturbed input (Laine_ICLR_2017; Tarvainen_NIPS_17; VAT). Recently, mixmatch propose , which unifies several dominant SSL approaches in one framework and achieves state-of-the-art performance.
Despite the individual advances in LNL and SSL, their connection has been underexplored. In this work, we propose , which addresses learning with label noise in a semi-supervised manner. Different from most existing LNL approaches, discards the sample labels that are highly likely to be noisy, and leverages the noisy samples as unlabeled data to regularize the model from overfitting and improve generalization performance. The key contributions of this work are:
We propose co-divide, which trains two networks simultaneously. For each network, we dynamically fit a Gaussian Mixture Model (GMM) on its per-sample loss distribution to divide the training samples into a labeled set and an unlabeled set. The divided data is then used to train the
other network. Co-divide keeps the two networks diverged, so that they can filter different types of error and avoid confirmation bias in self-training.During SSL phase, we improve with label co-refinement and co-guessing to account for label noise. For labeled samples, we refine their ground-truth labels using the network’s predictions guided by the GMM for the other network. For unlabeled samples, we use the ensemble of both networks to make reliable guesses for their labels.
We experimentally show that significantly advances state-of-the-art results on multiple benchmarks with different types and levels of label noise. We also provide extensive ablation study and qualitative results to examine the effect of different components.
Most existing methods for training DNNs with noisy labels seek to correct the loss function. The correction can be categorized in two types. The first type treats all samples equally and correct loss either explicitly or implicitly through relabeling the noisy samples. For relabeling methods, the noisy samples are modeled with directed graphical models (Tong_CVPR_2015), Conditional Random Fields (Vahdat_NIPS_2017)
(Li_ICCV_17), or DNNs (Andreas_CVPR_2017; Lee_CVPR_2018). However, they require access to a small set of clean samples. Recently, Tanaka_CVPR_2018 and Yi_2019_CVPR propose iterative methods which relabel samples using network predictions. For explicit loss correction. Reed_2015_ICLR propose a bootstrapping method which modifies the loss with model predictions, and Ma_ICML_2018 improve the bootstrapping method by exploiting the dimensionality of feature subspaces. Giorgio_CVPR_2017 estimate the label corruption matrix for loss correction, and Hendrycks_NIPS_2018 improve the corruption matrix by using a clean set of data. The second type of correction focuses on reweighting training samples or separating clean and noisy samples, which results in correcting the loss function (Abstention; Nikola_ICML_2019). A common method is to consider samples with smaller loss as clean ones (Shen_ICML_2019). Jiang_ICML_2018 train a mentor network to guide a student network by assigning weights to samples. Ren_ICML_2018 reweight samples based on their gradient directions. Chen_ICML_2019 apply cross validation to identify clean samples. Arazo_ICML_2019 calculate sample weights by modeling per-sample loss with a mixture model. co-teaching train two networks which select small-loss samples within each mini-batch to train each other, and Yu_ICML_2019 improve it by updating the network on disagreement data to keep the two networks diverged.Contrary to all aforementioned methods, our method discards the labels that are highly likely to be noisy, and utilize the noisy samples as unlabeled data to regularize training in a SSL manner. WACV and Recycling have shown that SSL method is effective in LNL. However, their methods do not perform well under high levels of noise, whereas our method can better distinguish and utilize noisy samples. Besides leveraging SSL, our method also introduces other advantages. Compared to self-training methods (Jiang_ICML_2018; Arazo_ICML_2019), our method can avoid the confirmation bias problem (Tarvainen_NIPS_17) by training two networks to filter error for each other. Compared to Co-teaching (co-teaching) and Co-teaching (Yu_ICML_2019)
, our method is more robust to noise by enabling the two networks to teach each other implicitly at each epoch (co-divide) and explicitly at each mini-batch (label co-refinement and co-guessing).
SSL methods aim to improve the model’s performance by leveraging unlabeled data. Current state-of-the-art SSL methods mostly involve adding an additional loss term on unlabeled data to regularize training. The regularization falls into two classes: consistency regularization (Laine_ICLR_2017; Tarvainen_NIPS_17; VAT) enforces the model to produce consistent predictions on augmented input data; entropy minimization (Grandvalet_NIPS_2005; Pseudo) encourages the model to give high-confidence predictions on unlabeled data. Recently, mixmatch propose , which unifies consistency regularization, entropy minimization, and the (mixup) regularization into one framework.
In this section, we introduce , our proposed method for learning with noisy labels. An overview of the method is shown in Figure 1. To avoid confirmation bias of self-training where the model would accumulate its errors, we simultaneously train two networks to filter errors for each other through epoch-level implicit teaching and batch-level explicit teaching. At each epoch, we perform co-divide, where one network divides the noisy training dataset into a clean labeled set () and a noisy unlabeled set (), which are then used by the other network. At each mini-batch, one network utilizes both labeled and unlabeled samples to perform semi-supervised learning guided by the other network. Algorithm 1 delineates the full algorithm.
Deep networks tend to learn clean samples faster than noisy samples (Arpit_ICML_2017), leading to lower loss for clean samples (co-teaching; Chen_ICML_2019). Following Arazo_ICML_2019, we aim to find the probability of a sample being clean by fitting a mixture model to the per-sample loss distribution. Formally, let denote the training data, where is an image and is the one-hot label over classes. Given a model with parameters , the cross-entropy loss reflects how well the model fits the training samples:
(1) |
where is the model’s output softmax probability for class .
Arazo_ICML_2019 fit a two-component Beta Mixture Model (BMM) to the max-normalized loss to model the distribution of clean and noisy samples. However, we find that BMM tends to produce undesirable flat distributions and fails when the label noise is asymmetric. Instead, Gaussian Mixture Model (GMM) (GMM) can better distinguish clean and noisy samples due to its flexibility in the sharpness of distribution. Therefore, we fit a two-component GMM to
using the Expectation-Maximization algorithm. For each sample, its clean probability
is the posterior probability
, where is the Gaussian component with smaller mean (smaller loss).We divide the training data into a labeled set and an unlabeled set by setting a threshold on . However, training a model using the data divided by itself could lead to confirmation bias (i.e. the model is prone to confirm its mistakes (Tarvainen_NIPS_17)), as noisy samples that are wrongly grouped into the labeled set would keep having lower loss due to the model overfitting to their labels. Therefore, we propose co-divide to avoid error accumulation. In co-divide, the GMM for one network is used to divide training data for the other network. The two networks are kept diverged from each other due to different (random) parameter initialization, different training data division, different (random) mini-batch sequence, and different training targets. Being diverged offers the two networks distinct abilities to filter different types of error, making the model more robust to noise.
Confidence Penalty for Asymmetric Noise. For initial convergence of the algorithm, we need to “warm up” the model for a few epochs by training on all data using the standard cross-entropy loss. The warm up is effective for symmetric (i.e. uniformly random) label noise. However, for asymmetric (i.e. class-conditional) label noise, the network would quickly overfit to noise during warm up and produce over-confident (low entropy) predictions, which leads to most samples having near-zero normalized loss (see Figure 2a). In such cases, the GMM cannot effectively distinguish clean and noisy samples based on the loss distribution. To address this issue, we penalize confident predictions from the network by adding a negative entropy term, (confidence), to the cross-entropy loss during warm up. The entropy of a model’s prediction for an input is defined as:
(2) |
By maximizing the entropy, becomes more evenly distributed (see Figure 2b) and easier to be modeled by the GMM. Furthermore, in Figure 2c we show when the model is trained with for 10 more epochs after warm up. The proposed method can significantly reduce the loss for clean samples while keeping the loss larger for most noisy samples.
At each epoch, having divided the training data, we train the two networks one at a time while keeping the other one fixed. Given a mini-batch of labeled samples with their corresponding one-hot labels and clean probability, , and a mini-batch of unlabeled samples , we exploit (mixmatch) for SSL. utilizes unlabeled data by merging consistency regularization (i.e. encourage the model to output same predictions on perturbed unlabeled data) and entropy minimization (i.e. encourage the model to output confident predictions on unlabeled data) with the (mixup) augmentation (i.e. encourage the model to have linear behaviour between samples).
To account for label noise, we make two improvements to which enable the two networks to teach each other. First, we perform label co-refinement for labeled samples by linearly combining the ground-truth label with the network’s prediction (averaged across multiple augmentations of ), guided by the clean probability produced by the other network:
(3) |
Then we apply a sharpening function on the refined label to reduce its temperature:
(4) |
Second, we use the ensemble of predictions from both networks to “co-guess” the labels for unlabeled samples (algorithm 1, line 20), which can produce more reliable guessed labels.
Having acquired (and ) which consists of multiple augmentations of labeled (unlabeled) samples and their refined (guessed) labels, we follow
to “mix” the data, where each sample is interpolated with another sample randomly chosen from the combined mini-batch of
and . Specifically, for a pair of samples and their corresponding labels , the mixed is computed by:(5) | ||||
(6) | ||||
(7) | ||||
(8) |
transforms and into and . Equation 6 ensures that are “closer” to than . The loss on is the cross-entropy loss and the loss on is the mean squared error:
(9) | ||||
(10) |
Under high levels of noise, the network would be encouraged to predict the same class to minimize the loss. To prevent assigning all samples to a single class, we apply the regularization term used by Tanaka_CVPR_2018 and Arazo_ICML_2019, which uses a uniform prior distribution (i.e. ) to regularize the model’s average output across all samples in the mini-batch:
(11) |
Finally, the total loss is:
(12) |
In our experiments, we set as 1 and use to control the strength of the unsupervised loss.
We extensively validate our method on four benchmark datasets, namely CIFAR-10, CIFAR-100 (cifar), Clothing1M (Tong_CVPR_2015), and WebVision (webvision). Both CIFAR-10 and CIFAR-100 contain 50K training images and 10K test images of size . Following previous works (Tanaka_CVPR_2018; MLNT), we experiment with two types of label noise: symmetric and asymmetric. Symmetric noise is generated by randomly replacing the labels for a percentage of the training data with all possible labels. Note that there is another criterion for symmetric label noise injection where the true labels cannot be maintained (Jiang_ICML_2018; Wang_CVPR_2018), for which we also report the results (Table 6 in Appendix). Asymmetric noise is designed to mimic the structure of real-world label noise, where labels are only replaced by similar classes (e.g. deerhorse, dogcat).
We use an 18-layer PreAct Resnet (He_ECCV_2016)
and train it using SGD with a momentum of 0.9, a weight decay of 0.0005, and a batch size of 128. The network is trained for 300 epochs. We set the initial learning rate as 0.02, and reduce it by a factor of 10 after 150 epochs. The warm up period is 10 epochs for CIFAR-10 and 30 epochs for CIFAR-100. We find that most hyperparameters introduced by
do not need to be heavily tuned. For all CIFAR experiments, we use the same hyperparameters , , and . is set as 0.5 except for noise ratio when it is set as 0.6. We choose from using a small validation set.Clothing1M and WebVision 1.0 are two large-scale datasets with real-world noisy labels. Clothing1M consists of 1 million training images collected from online shopping websites with labels generated from surrounding texts. We follow previous work (MLNT)
and use ResNet-50 with ImageNet pretrained weights. WebVision contains 2.4 million images crawled from the web using the 1,000 concepts in ImageNet ILSVRC12. Following previous work
(Chen_ICML_2019), we compare baseline methods on the first 50 classes of the Google image subset using the inception-resnet v2 (InceptionResnet). The training details are delineated in Appendix B.We compare with multiple baselines using the same network architecture. Here we introduce some of the most recent state-of-the-art methods: Meta-Learning (MLNT) proposes a gradient based method to find model parameters that are more noise-tolerant; Joint-Optim (Tanaka_CVPR_2018) and P-correction (Yi_2019_CVPR) jointly optimize the sample labels and the network parameters; M-correction (Arazo_ICML_2019) models sample loss with BMM and applies . Note that none of these methods can consistently outperform others across different datasets. M-correction excels at symmetric noise, whereas Meta-Learning performs better for asymmetric noise.
Dataset | CIFAR-10 | CIFAR-100 | |||||||
Method/Noise ratio | 20% | 50% | 80% | 90% | 20% | 50% | 80% | 90% | |
Cross-Entropy | Best | 86.8 | 79.4 | 62.9 | 42.7 | 62.0 | 46.7 | 19.9 | 10.1 |
Last | 82.7 | 57.9 | 26.1 | 16.8 | 61.8 | 37.3 | 8.8 | 3.5 | |
Bootstrap | Best | 86.8 | 79.8 | 63.3 | 42.9 | 62.1 | 46.6 | 19.9 | 10.2 |
(Reed_2015_ICLR) | Last | 82.9 | 58.4 | 26.8 | 17.0 | 62.0 | 37.9 | 8.9 | 3.8 |
F-correction | Best | 86.8 | 79.8 | 63.3 | 42.9 | 61.5 | 46.6 | 19.9 | 10.2 |
(Giorgio_CVPR_2017) | Last | 83.1 | 59.4 | 26.2 | 18.8 | 61.4 | 37.3 | 9.0 | 3.4 |
Co-teaching | Best | 89.5 | 85.7 | 67.4 | 47.9 | 65.6 | 51.8 | 27.9 | 13.7 |
(Yu_ICML_2019) | Last | 88.2 | 84.1 | 45.5 | 30.1 | 64.1 | 45.3 | 15.5 | 8.8 |
Mixup | Best | 95.6 | 87.1 | 71.6 | 52.2 | 67.8 | 57.3 | 30.8 | 14.6 |
(mixup) | Last | 92.3 | 77.6 | 46.7 | 43.9 | 66.0 | 46.6 | 17.6 | 8.1 |
P-correction | Best | 92.4 | 89.1 | 77.5 | 58.9 | 69.4 | 57.5 | 31.1 | 15.3 |
(Yi_2019_CVPR) | Last | 92.0 | 88.7 | 76.5 | 58.2 | 68.1 | 56.4 | 20.7 | 8.8 |
Meta-Learning | Best | 92.9 | 89.3 | 77.4 | 58.7 | 68.5 | 59.2 | 42.4 | 19.5 |
(MLNT) | Last | 92.0 | 88.8 | 76.1 | 58.3 | 67.7 | 58.0 | 40.1 | 14.3 |
M-correction | Best | 94.0 | 92.0 | 86.8 | 69.1 | 73.9 | 66.1 | 48.2 | 24.3 |
(Arazo_ICML_2019) | Last | 93.8 | 91.9 | 86.6 | 68.7 | 73.4 | 65.4 | 47.6 | 20.5 |
DivideMix | Best | 96.1 | 94.6 | 93.2 | 76.0 | 77.3 | 74.6 | 60.2 | 31.5 |
Last | 95.7 | 94.4 | 92.9 | 75.4 | 76.9 | 74.2 | 59.6 | 31.0 |
Table 1 shows the results on CIFAR-10 and CIFAR-100 with different levels of symmetric label noise ranging from to . We report both the best test accuracy across all epochs and the averaged test accuracy over the last 10 epochs. outperforms state-of-the-art methods by a large margin across all noise ratios. The improvement is substantial (10% in accuracy) for the more challenging CIFAR-100 with high noise ratios. Appendix A shows comparison with more methods in Table 6. The results on CIFAR-10 with asymmetric noise is shown in Table 2. We use because certain classes become theoretically indistinguishable for asymmetric noise larger than .
Method | Best | Last |
Cross-Entropy | 85.0 | 72.3 |
F-correction (Giorgio_CVPR_2017) | 87.2 | 83.1 |
M-correction (Arazo_ICML_2019) | 87.4 | 86.3 |
Iterative-CV (Chen_ICML_2019) | 88.6 | 88.0 |
P-correction (Yi_2019_CVPR) | 88.5 | 88.1 |
Joint-Optim (Tanaka_CVPR_2018) | 88.9 | 88.4 |
Meta-Learning (MLNT) | 89.2 | 88.6 |
DivideMix | 93.4 | 92.1 |
Table 3 and Table 4 show the results on Clothing1M and WebVision, respectively. consistently outperforms state-of-the-art methods across all datasets with different types of label noise. For WebVision, we achieve more than 12% improvement in top-1 accuracy.
Method | Test Accuracy |
Cross-Entropy | 69.21 |
F-correction (Giorgio_CVPR_2017) | 69.84 |
M-correction (Arazo_ICML_2019) | 71.00 |
Joint-Optim (Tanaka_CVPR_2018) | 72.16 |
Meta-Cleaner (MetaCleaner) | 72.50 |
Meta-Learning (MLNT) | 73.47 |
P-correction (Yi_2019_CVPR) | 73.49 |
DivideMix | 74.76 |
Method | WebVision | ILSVRC12 | ||
top1 | top5 | top1 | top5 | |
F-correction (Giorgio_CVPR_2017) | 61.12 | 82.68 | 57.36 | 82.36 |
Decoupling (decouple) | 62.54 | 84.74 | 58.26 | 82.26 |
D2L (Ma_ICML_2018) | 62.68 | 84.00 | 57.80 | 81.36 |
MentorNet (Jiang_ICML_2018) | 63.00 | 81.40 | 57.80 | 79.92 |
Co-teaching (co-teaching) | 63.58 | 85.20 | 61.48 | 84.70 |
Iterative-CV (Chen_ICML_2019) | 65.24 | 85.34 | 61.60 | 84.98 |
DivideMix | 77.32 | 91.64 | 75.20 | 90.84 |
We study the effect of removing different components to provide insights into what makes successful. We analyze the results in Table 5 as follows. Appendix C contains additional explanations.
Dataset | CIFAR-10 | CIFAR-100 | ||||||||
Noise type | Sym. | Asym. | Sym. | |||||||
Methods/Noise ratio | 20% | 50% | 80% | 90% | 40% | 20% | 50% | 80% | 90% | |
DivideMix | Best | 96.1 | 94.6 | 93.2 | 76.0 | 93.4 | 77.3 | 74.6 | 60.2 | 31.5 |
Last | 95.7 | 94.4 | 92.9 | 75.4 | 92.1 | 76.9 | 74.2 | 59.6 | 31.0 | |
DivideMix with test | Best | 95.2 | 94.2 | 93.0 | 75.5 | 92.7 | 75.2 | 72.8 | 58.3 | 29.9 |
Last | 95.0 | 93.7 | 92.4 | 74.2 | 91.4 | 74.8 | 72.1 | 57.6 | 29.2 | |
DivideMix w/o co-training | Best | 95.0 | 94.0 | 92.6 | 74.3 | 91.9 | 74.8 | 72.3 | 56.7 | 27.7 |
Last | 94.8 | 93.3 | 92.2 | 73.2 | 90.6 | 74.1 | 71.7 | 56.3 | 27.2 | |
DivideMix w/o label refinement | Best | 96.0 | 94.6 | 93.0 | 73.7 | 87.7 | 76.9 | 74.2 | 58.7 | 26.9 |
Last | 95.5 | 94.2 | 92.7 | 73.0 | 86.3 | 76.4 | 73.9 | 58.2 | 26.3 | |
DivideMix w/o augmentation | Best | 95.3 | 94.1 | 92.2 | 73.9 | 89.5 | 76.5 | 73.1 | 58.2 | 26.9 |
Last | 94.9 | 93.5 | 91.8 | 73.0 | 88.4 | 76.2 | 72.6 | 58.0 | 26.4 | |
Divide and | Best | 94.1 | 92.8 | 89.7 | 70.1 | 86.5 | 73.7 | 70.5 | 55.3 | 25.0 |
Last | 93.5 | 92.3 | 89.1 | 68.6 | 85.2 | 72.4 | 69.7 | 53.9 | 23.7 |
[leftmargin=*]
To study the effect of model ensemble during test, we use the prediction from a single model instead of averaging the predictions from both networks as in . Note that the training process remains unchanged. The decrease in accuracy suggests that the ensemble of two diverged networks consistently yields better performance during inference.
To study the effect of co-training, we train a single network using self-divide (i.e. divide the training data based on its own loss). The performance further decreases compared to .
We find that both label refinement and input augmentation are beneficial for .
We combine self-divide with the original as a naive baseline for using SLL in LNL.
Appendix A also introduces more in-depth studies in examining the robustness of our method to label noise, including the AUC for clean/noisy sample classification on CIFAR-10 training data, qualitative examples from Clothing1M where our method can effectively identify the noisy samples and leverage them as unlabeled data, and visualization results using t-SNE.
In this paper, we propose for learning with noisy labels by leveraging SSL. Our method trains two networks simultaneously and achieves robustness to noise through dataset co-divide, label co-refinement and co-guessing. Through extensive experiments across multiple datasets, we show that consistently exhibits substantial performance improvements compared to state-of-the-art methods. For future work, we are interested in incorporating additional ideas from SSL to LNL, and vice versa. Furthermore, we are also interested in adapting to other domains such as NLP.
In Table 6, we compare with previous methods under the symmetric noise setting where true labels cannot be maintained. significantly outperforms previous methods which use deeper or wider network architectures.
Method | Architecture | CIFAR-10 | CIFAR-100 | ||||||
20% | 40% | 60% | 80% | 20% | 40% | 60% | 80% | ||
MentorNet (Jiang_ICML_2018) | WRN-101 | 92.0 | 89.0 | - | 49.0 | 73.0 | 68.0 | - | 35.0 |
D2L (Ma_ICML_2018) | CNN-12/RN-44 | 85.1 | 83.4 | 72.8 | - | 62.2 | 52.0 | 42.3 | - |
Reweight (Ren_ICML_2018) | WRN-28 | 86.9 | - | - | - | 61.3 | - | - | - |
Abstention (Abstention) | WRN-28 | 93.4 | 90.9 | 87.6 | 70.8 | 75.8 | 68.2 | 59.4 | 34.1 |
DivideMix | PRN-18 | 96.2 | 94.9 | 94.3 | 79.8 | 77.2 | 75.2 | 72.0 | 60.0 |
In Figure 3, we show the Area Under a Curve (AUC) for clean/noisy sample classification on CIFAR-10 training data from one of the GMMs during the first 100 epochs. Our method can effectively separate clean and noisy samples as training proceeds, even for high noise ratio.
In Figure 4, we show example images in Clothing1M identified by our method as noisy samples. Our method achieves noise filtering by discarding the noisy labels (shown in red) and using the co-guessed labels (shown in blue) to regularize training.
In Figure 5, we visualize the features of training images using t-SNE (tsne). The model is trained using for 200 epochs on CIFAR-10 with 80% label noise. The embeddings form 10 distinct clusters corresponding to the true class labels, not the noisy training labels, which demonstrates our method’s robustness to label noise.
For CIFAR experiments, the only hyperparameter that we tune on a per-experiment basis is the unsupervised loss weight . Table 7 shows the value that we use. A larger is required for stronger regularization under high noise ratios or with more classes.
For both Clothing1M and WebVision, we use the same set of hyperparameters , , , , , and train the network using SGD with a momentum of 0.9, a weight decay of 0.001, and a batch size of 32. The warm up period is 1 epoch. For Clothing1M, we train the network for 80 epochs. The initial learning rate is set as 0.002 and reduced by a factor of 10 after 40 epochs. For each epoch, we sample 1000 mini-batches from the training data while ensuring the labels (noisy) are balanced. For WebVision, we train the network for 100 epochs. The initial learning rate is set as 0.01 and reduced by a factor of 10 after 50 epochs.
Hyperparameter | CIFAR-10 | CIFAR-100 | |||||||
Asym. 40% | 20% | 50% | 80% | 90% | 20% | 50% | 80% | 90% | |
0 | 0 | 25 | 25 | 50 | 25 | 150 | 150 | 150 |
Here we clarify some details for the baseline methods in the ablation study. First, DivideMix w/o co-training still has dataset division, label refinement and label guessing, but performed by the same model. Thus, the performance drop (especially for CIFAR-100 with high noise ratio) suggests the disadvantage of self-training. Second, label refinement is important for high noise ratio because more noisy samples would be mistakenly divided into the labeled set. Third, augmentation improves performance through both producing more reliable predictions and achieving consistency regularization. In addition, same as mixmatch, we also find that temperature sharpening is essential for our method to perform well.
We analyse the training time of to understand its efficiency. In Table 8, we compare the total training time of on CIFAR-10 with several state-of-the-art methods, using a single Nvidia V100 GPU. is slower than Co-teaching (Yu_ICML_2019), but faster than P-correction (Yi_2019_CVPR) and Meta-Learning (MLNT) which involve multiple training iterations. In Table 9, we also break down the computation time for each operation in .
Co-teaching | P-correction | Meta-Learning | DivideMix |
4.3 h | 6.0 h | 8.6 h | 5.2 h |
Comments
There are no comments yet.