Pairwise Similarity Distribution Clustering for Noisy Label Learning

• URL: http://arxiv.org/abs/2404.01853v1
• Date: Tue, 2 Apr 2024 11:30:22 GMT
• Title: Pairwise Similarity Distribution Clustering for Noisy Label Learning
• Authors: Sihan Bai,
• Abstract summary: Noisy label learning aims to train deep neural networks using a large amount of samples with noisy labels. We propose a simple yet effective sample selection algorithm to divide the training samples into one clean set and another noisy set. Experimental results on various benchmark datasets, such as CIFAR-10, CIFAR-100 and Clothing1M, demonstrate significant improvements over state-of-the-art methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noisy label learning aims to train deep neural networks using a large amount of samples with noisy labels, whose main challenge comes from how to deal with the inaccurate supervision caused by wrong labels. Existing works either take the label correction or sample selection paradigm to involve more samples with accurate labels into the training process. In this paper, we propose a simple yet effective sample selection algorithm, termed as Pairwise Similarity Distribution Clustering~(PSDC), to divide the training samples into one clean set and another noisy set, which can power any of the off-the-shelf semi-supervised learning regimes to further train networks for different downstream tasks. Specifically, we take the pairwise similarity between sample pairs to represent the sample structure, and the Gaussian Mixture Model~(GMM) to model the similarity distribution between sample pairs belonging to the same noisy cluster, therefore each sample can be confidently divided into the clean set or noisy set. Even under severe label noise rate, the resulting data partition mechanism has been proved to be more robust in judging the label confidence in both theory and practice. Experimental results on various benchmark datasets, such as CIFAR-10, CIFAR-100 and Clothing1M, demonstrate significant improvements over state-of-the-art methods.

Related papers

• Mitigating Noisy Supervision Using Synthetic Samples with Soft Labels [13.314778587751588]
  Noisy labels are ubiquitous in real-world datasets, especially in the large-scale ones derived from crowdsourcing and web searching. It is challenging to train deep neural networks with noisy datasets since the networks are prone to overfitting the noisy labels during training. We propose a framework that trains the model with new synthetic samples to mitigate the impact of noisy labels.
  arXiv  Detail & Related papers  (2024-06-22T04:49:39Z)
• Robust Noisy Label Learning via Two-Stream Sample Distillation [48.73316242851264]
  Noisy label learning aims to learn robust networks under the supervision of noisy labels. We design a simple yet effective sample selection framework, termed Two-Stream Sample Distillation (TSSD) This framework can extract more high-quality samples with clean labels to improve the robustness of network training.
  arXiv  Detail & Related papers  (2024-04-16T12:18:08Z)
• Extracting Clean and Balanced Subset for Noisy Long-tailed Classification [66.47809135771698]
  We develop a novel pseudo labeling method using class prototypes from the perspective of distribution matching. By setting a manually-specific probability measure, we can reduce the side-effects of noisy and long-tailed data simultaneously. Our method can extract this class-balanced subset with clean labels, which brings effective performance gains for long-tailed classification with label noise.
  arXiv  Detail & Related papers  (2024-04-10T07:34:37Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• PASS: Peer-Agreement based Sample Selection for training with Noisy Labels [16.283722126438125]
  The prevalence of noisy-label samples poses a significant challenge in deep learning, inducing overfitting effects. Current methodologies often rely on the small-loss hypothesis or feature-based selection to separate noisy- and clean-label samples. We propose a new noisy-label detection method, termed Peer-Agreement based Sample Selection (PASS), to address this problem.
  arXiv  Detail & Related papers  (2023-03-20T00:35:33Z)
• Neighborhood Collective Estimation for Noisy Label Identification and Correction [92.20697827784426]
  Learning with noisy labels (LNL) aims at designing strategies to improve model performance and generalization by mitigating the effects of model overfitting to noisy labels. Recent advances employ the predicted label distributions of individual samples to perform noise verification and noisy label correction, easily giving rise to confirmation bias. We propose Neighborhood Collective Estimation, in which the predictive reliability of a candidate sample is re-estimated by contrasting it against its feature-space nearest neighbors.
  arXiv  Detail & Related papers  (2022-08-05T14:47:22Z)
• Sample Prior Guided Robust Model Learning to Suppress Noisy Labels [8.119439844514973]
  We propose PGDF, a novel framework to learn a deep model to suppress noise by generating the samples' prior knowledge. Our framework can save more informative hard clean samples into the cleanly labeled set. We evaluate our method using synthetic datasets based on CIFAR-10 and CIFAR-100, as well as on the real-world datasets WebVision and Clothing1M.
  arXiv  Detail & Related papers  (2021-12-02T13:09:12Z)
• S3: Supervised Self-supervised Learning under Label Noise [53.02249460567745]
  In this paper we address the problem of classification in the presence of label noise. In the heart of our method is a sample selection mechanism that relies on the consistency between the annotated label of a sample and the distribution of the labels in its neighborhood in the feature space. Our method significantly surpasses previous methods on both CIFARCIFAR100 with artificial noise and real-world noisy datasets such as WebVision and ANIMAL-10N.
  arXiv  Detail & Related papers  (2021-11-22T15:49:20Z)
• Transform consistency for learning with noisy labels [9.029861710944704]
  We propose a method to identify clean samples only using one single network. Clean samples prefer to reach consistent predictions for the original images and the transformed images. In order to mitigate the negative influence of noisy labels, we design a classification loss by using the off-line hard labels and on-line soft labels.
  arXiv  Detail & Related papers  (2021-03-25T14:33:13Z)
• DivideMix: Learning with Noisy Labels as Semi-supervised Learning [111.03364864022261]
  We propose DivideMix, a framework for learning with noisy labels. Experiments on multiple benchmark datasets demonstrate substantial improvements over state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-02-18T06:20:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.