Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection

• URL: http://arxiv.org/abs/2503.10115v1
• Date: Thu, 13 Mar 2025 07:21:29 GMT
• Title: Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection
• Authors: Hanlin Pan, Kunpeng Liu, Wanfu Gao,
• Abstract summary: The purpose of partial multi-label feature selection is to select the most representative subset, where the data comes from partial multi-label datasets that have label ambiguity issues.<n>Previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features.<n>This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space.
• Score: 3.971316989443196
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The purpose of partial multi-label feature selection is to select the most representative feature subset, where the data comes from partial multi-label datasets that have label ambiguity issues. For label disambiguation, previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features. However, the information existing in the feature space is rarely considered, especially in partial multi-label scenarios where the noises is considered to be concentrated in the label space while the feature information is correct. This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space through the structural consistency between labels and features. In addition, previous methods overestimate the consistency of features and labels in the latent space after convergence. We comprehensively consider the similarity of latent space projections to feature space and label space, and propose new feature selection term. This method also significantly improves the positive label identification ability of the selected features. Comprehensive experiments demonstrate the superiority of the proposed method.

Related papers

• Bridging Annotation Gaps: Transferring Labels to Align Object Detection Datasets [26.566426911250296]
  Label-Aligned Transfer Proposal (LAT) systematically projects annotations from diverse source datasets into a target label space.<n>LAT achieves consistent improvements in target-domain detection performance, achieving gains of up to +4.8AP over semi-supervised baselines.
  arXiv  Detail & Related papers  (2025-06-05T08:16:15Z)
• Graph Random Walk with Feature-Label Space Alignment: A Multi-Label Feature Selection Method [6.529607327474487]
  Rapid growth in feature dimension may introduce implicit associations between features and labels in multi-label datasets.<n>Existing methods often adopt low-dimensional linear decomposition to explore the associations between features and labels.<n>We propose innovative solutions, including a random walk graph that integrates feature-feature, label-label, and feature-label relationships.
  arXiv  Detail & Related papers  (2025-05-29T08:28:02Z)
• Semi-Supervised Multi-Label Feature Selection with Consistent Sparse Graph Learning [13.401566810844368]
  Existing multi-label methods fail to evaluate the label correlations without enough labeled samples.<n>The similarity graph structure directly derived from the original feature space is suboptimal for multi-label problems.<n>We propose a consistent sparse graph learning method for multi-label semi-supervised feature selection.
  arXiv  Detail & Related papers  (2025-05-23T13:25:41Z)
• GPMFS: Global Foundation and Personalized Optimization for Multi-Label Feature Selection [0.820217860574125]
  The curse of dimensionality remains one of the major bottlenecks in high-dimensional multi-label learning. We propose a novel method called GPMFS (Global Foundation and Personalized Optimization for Multi-Label Feature Selection) Experiments on multiple real-world datasets demonstrate that GPMFS achieves superior performance while maintaining strong interpretability and robustness.
  arXiv  Detail & Related papers  (2025-04-17T08:29:14Z)
• Modeling Multi-modal Cross-interaction for Multi-label Few-shot Image Classification Based on Local Feature Selection [55.144394711196924]
  A key feature of the multi-label setting is that an image often has several labels.<n>We propose a strategy in which label prototypes are gradually refined.<n> Experiments on COCO, PASCAL VOC, NUS-WIDE, and iMaterialist show that our model substantially improves the current state-of-the-art.
  arXiv  Detail & Related papers  (2024-12-18T11:10:18Z)
• Mixed Blessing: Class-Wise Embedding guided Instance-Dependent Partial Label Learning [53.64180787439527]
  In partial label learning (PLL), every sample is associated with a candidate label set comprising the ground-truth label and several noisy labels.<n>For the first time, we create class-wise embeddings for each sample, which allow us to explore the relationship of instance-dependent noisy labels.<n>To reduce the high label ambiguity, we introduce the concept of class prototypes containing global feature information.
  arXiv  Detail & Related papers  (2024-12-06T13:25:39Z)
• 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)
• Multi-Label Feature Selection Using Adaptive and Transformed Relevance [0.0]
  This paper presents a novel information-theoretical filter-based multi-label feature selection, called ATR, with a new function. ATR ranks features considering individual labels as well as abstract label space discriminative powers. Our experiments affirm the scalability of ATR for benchmarks characterized by extensive feature and label spaces.
  arXiv  Detail & Related papers  (2023-09-26T09:01:38Z)
• Contrastive Label Enhancement [13.628665406039609]
  We propose Contrastive Label Enhancement (ConLE) to generate high-level features by contrastive learning strategy. We leverage the obtained high-level features to gain label distributions through a welldesigned training strategy.
  arXiv  Detail & Related papers  (2023-05-16T14:53:07Z)
• SepLL: Separating Latent Class Labels from Weak Supervision Noise [4.730767228515796]
  In weakly supervised learning, labeling functions automatically assign, often noisy, labels to data samples. In this work, we provide a method for learning from weak labels by separating two types of complementary information. Our model is competitive with the state-of-the-art, and yields a new best average performance.
  arXiv  Detail & Related papers  (2022-10-25T10:33:45Z)
• Part-based Pseudo Label Refinement for Unsupervised Person Re-identification [29.034390810078172]
  Unsupervised person re-identification (re-ID) aims at learning discriminative representations for person retrieval from unlabeled data. Recent techniques accomplish this task by using pseudo-labels, but these labels are inherently noisy and deteriorate the accuracy. We propose a novel Part-based Pseudo Label Refinement (PPLR) framework that reduces the label noise by employing the complementary relationship between global and part features.
  arXiv  Detail & Related papers  (2022-03-28T12:15:53Z)
• Learning Discriminative Features using Multi-label Dual Space [8.510041322997116]
  We propose a novel method in multi-label learning to learn the projection matrix from the feature space to semantic label space. We show that the learned projection matrix identifies a subset of discriminative features across multiple semantic labels.
  arXiv  Detail & Related papers  (2021-02-25T23:53:21Z)
• Dual-Refinement: Joint Label and Feature Refinement for Unsupervised Domain Adaptive Person Re-Identification [51.98150752331922]
  Unsupervised domain adaptive (UDA) person re-identification (re-ID) is a challenging task due to the missing of labels for the target domain data. We propose a novel approach, called Dual-Refinement, that jointly refines pseudo labels at the off-line clustering phase and features at the on-line training phase. Our method outperforms the state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2020-12-26T07:35:35Z)
• mDALU: Multi-Source Domain Adaptation and Label Unification with Partial Datasets [102.62639692656458]
  This paper treats this task as a multi-source domain adaptation and label unification problem. Our method consists of a partially-supervised adaptation stage and a fully-supervised adaptation stage. We verify the method on three different tasks, image classification, 2D semantic image segmentation, and joint 2D-3D semantic segmentation.
  arXiv  Detail & Related papers  (2020-12-15T15:58:03Z)
• Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptation [55.73722120043086]
  We develop a "Select, Label, and Mix" (SLM) framework to learn discriminative invariant feature representations for partial domain adaptation. First, we present a simple yet efficient "select" module that automatically filters out outlier source samples to avoid negative transfer. Second, the "label" module iteratively trains the classifier using both the labeled source domain data and the generated pseudo-labels for the target domain to enhance the discriminability of the latent space.
  arXiv  Detail & Related papers  (2020-12-06T19:29:32Z)

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.