Mixed Blessing: Class-Wise Embedding guided Instance-Dependent Partial Label Learning

• URL: http://arxiv.org/abs/2412.05029v1
• Date: Fri, 06 Dec 2024 13:25:39 GMT
• Title: Mixed Blessing: Class-Wise Embedding guided Instance-Dependent Partial Label Learning
• Authors: Fuchao Yang, Jianhong Cheng, Hui Liu, Yongqiang Dong, Yuheng Jia, Junhui Hou,
• Abstract summary: In partial label learning (PLL), every sample is associated with a candidate label set comprising the ground-truth label and several noisy labels. For the first time, we create class-wise embeddings for each sample, which allow us to explore the relationship of instance-dependent noisy labels. To reduce the high label ambiguity, we introduce the concept of class prototypes containing global feature information.
• Score: 53.64180787439527
• License:
• Abstract: In partial label learning (PLL), every sample is associated with a candidate label set comprising the ground-truth label and several noisy labels. The conventional PLL assumes the noisy labels are randomly generated (instance-independent), while in practical scenarios, the noisy labels are always instance-dependent and are highly related to the sample features, leading to the instance-dependent partial label learning (IDPLL) problem. Instance-dependent noisy label is a double-edged sword. On one side, it may promote model training as the noisy labels can depict the sample to some extent. On the other side, it brings high label ambiguity as the noisy labels are quite undistinguishable from the ground-truth label. To leverage the nuances of IDPLL effectively, for the first time we create class-wise embeddings for each sample, which allow us to explore the relationship of instance-dependent noisy labels, i.e., the class-wise embeddings in the candidate label set should have high similarity, while the class-wise embeddings between the candidate label set and the non-candidate label set should have high dissimilarity. Moreover, to reduce the high label ambiguity, we introduce the concept of class prototypes containing global feature information to disambiguate the candidate label set. Extensive experimental comparisons with twelve methods on six benchmark data sets, including four fine-grained data sets, demonstrate the effectiveness of the proposed method. The code implementation is publicly available at https://github.com/Yangfc-ML/CEL.

Related papers

• Exploiting Conjugate Label Information for Multi-Instance Partial-Label Learning [61.00359941983515]
  Multi-instance partial-label learning (MIPL) addresses scenarios where each training sample is represented as a multi-instance bag associated with a candidate label set containing one true label and several false positives. ELIMIPL exploits the conjugate label information to improve the disambiguation performance.
  arXiv  Detail & Related papers  (2024-08-26T15:49:31Z)
• Determined Multi-Label Learning via Similarity-Based Prompt [12.428779617221366]
  In multi-label classification, each training instance is associated with multiple class labels simultaneously. To alleviate this problem, a novel labeling setting termed textitDetermined Multi-Label Learning (DMLL) is proposed.
  arXiv  Detail & Related papers  (2024-03-25T07:08:01Z)
• Pseudo-labelling meets Label Smoothing for Noisy Partial Label Learning [8.387189407144403]
  Partial label learning (PLL) is a weakly-supervised learning paradigm where each training instance is paired with a set of candidate labels (partial label) NPLL relaxes this constraint by allowing some partial labels to not contain the true label, enhancing the practicality of the problem. We present a minimalistic framework that initially assigns pseudo-labels to images by exploiting the noisy partial labels through a weighted nearest neighbour algorithm.
  arXiv  Detail & Related papers  (2024-02-07T13:32:47Z)
• Appeal: Allow Mislabeled Samples the Chance to be Rectified in Partial Label Learning [55.4510979153023]
  In partial label learning (PLL), each instance is associated with a set of candidate labels among which only one is ground-truth. To help these mislabeled samples "appeal," we propose the first appeal-based framework.
  arXiv  Detail & Related papers  (2023-12-18T09:09:52Z)
• Imprecise Label Learning: A Unified Framework for Learning with Various Imprecise Label Configurations [91.67511167969934]
  imprecise label learning (ILL) is a framework for the unification of learning with various imprecise label configurations. We demonstrate that ILL can seamlessly adapt to partial label learning, semi-supervised learning, noisy label learning, and, more importantly, a mixture of these settings.
  arXiv  Detail & Related papers  (2023-05-22T04:50:28Z)
• Complementary Classifier Induced Partial Label Learning [54.61668156386079]
  In partial label learning (PLL), each training sample is associated with a set of candidate labels, among which only one is valid. In disambiguation, the existing works usually do not fully investigate the effectiveness of the non-candidate label set. In this paper, we use the non-candidate labels to induce a complementary classifier, which naturally forms an adversarial relationship against the traditional classifier.
  arXiv  Detail & Related papers  (2023-05-17T02:13:23Z)
• Decomposition-based Generation Process for Instance-Dependent Partial Label Learning [45.133781119468836]
  Partial label learning (PLL) is a typical weakly supervised learning problem, where each training example is associated with a set of candidate labels among which only one is true. Most existing approaches assume that the incorrect labels in each training example are randomly picked as the candidate labels and model the generation process of the candidate labels in a simple way. We propose Maximum A Posterior(MAP) based on an explicitly modeled generation process of candidate labels.
  arXiv  Detail & Related papers  (2022-04-08T05:18:51Z)
• Instance-Dependent Partial Label Learning [69.49681837908511]
  Partial label learning is a typical weakly supervised learning problem. Most existing approaches assume that the incorrect labels in each training example are randomly picked as the candidate labels. In this paper, we consider instance-dependent and assume that each example is associated with a latent label distribution constituted by the real number of each label.
  arXiv  Detail & Related papers  (2021-10-25T12:50:26Z)
• Evaluating Multi-label Classifiers with Noisy Labels [0.7868449549351487]
  In the real world, it is more common to deal with noisy datasets than clean datasets. We present a Context-Based Multi-Label-Classifier (CbMLC) that effectively handles noisy labels. We show CbMLC yields substantial improvements over the previous methods in most cases.
  arXiv  Detail & Related papers  (2021-02-16T19:50:52Z)
• Multi-Level Generative Models for Partial Label Learning with Non-random Label Noise [47.01917619550429]
  We propose a novel multi-level generative model for partial label learning (MGPLL) It learns both a label level adversarial generator and a feature level adversarial generator under a bi-directional mapping framework. The proposed approach demonstrates the state-of-the-art performance for partial label learning.
  arXiv  Detail & Related papers  (2020-05-11T20:13:19Z)

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.