Component Adaptive Clustering for Generalized Category Discovery

• URL: http://arxiv.org/abs/2507.01711v1
• Date: Wed, 02 Jul 2025 13:41:30 GMT
• Title: Component Adaptive Clustering for Generalized Category Discovery
• Authors: Mingfu Yan, Jiancheng Huang, Yifan Liu, Shifeng Chen,
• Abstract summary: We propose a cluster-centric contrastive learning framework that incorporates Adaptive Slot Attention (AdaSlot) into the Generalized Category Discovery (GCD) framework.<n>AdaSlot dynamically determines the optimal number of slots based on data complexity, removing the need for predefined slot counts.<n>Our method captures both instance-specific and spatially clustered features, improving class discovery in open-world scenarios.
• Score: 13.322393552334063
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generalized Category Discovery (GCD) tackles the challenging problem of categorizing unlabeled images into both known and novel classes within a partially labeled dataset, without prior knowledge of the number of unknown categories. Traditional methods often rely on rigid assumptions, such as predefining the number of classes, which limits their ability to handle the inherent variability and complexity of real-world data. To address these shortcomings, we propose AdaGCD, a cluster-centric contrastive learning framework that incorporates Adaptive Slot Attention (AdaSlot) into the GCD framework. AdaSlot dynamically determines the optimal number of slots based on data complexity, removing the need for predefined slot counts. This adaptive mechanism facilitates the flexible clustering of unlabeled data into known and novel categories by dynamically allocating representational capacity. By integrating adaptive representation with dynamic slot allocation, our method captures both instance-specific and spatially clustered features, improving class discovery in open-world scenarios. Extensive experiments on public and fine-grained datasets validate the effectiveness of our framework, emphasizing the advantages of leveraging spatial local information for category discovery in unlabeled image datasets.

Related papers

• Learning Part Knowledge to Facilitate Category Understanding for Fine-Grained Generalized Category Discovery [10.98097145569408]
  Generalized Category Discovery (GCD) aims to classify unlabeled data containing both seen and novel categories.<n>We propose incorporating part knowledge to address fine-grained GCD, which introduces two key challenges.
  arXiv  Detail & Related papers  (2025-03-21T01:37:51Z)
• HOpenCls: Training Hyperspectral Image Open-Set Classifiers in Their Living Environments [12.486470619228776]
  Hyperspectral image (HSI) open-set classification is critical for HSI classification models deployed in real-world environments.<n>This paper proposes a novel framework, HOpenCls, to leverage the unlabeled wild data.<n>Experiment results demonstrate that wild data has the potential to significantly enhance open-set HSI classification in complex real-world scenarios.
  arXiv  Detail & Related papers  (2025-02-21T02:59:18Z)
• Generalized Category Discovery with Clustering Assignment Consistency [56.92546133591019]
  Generalized category discovery (GCD) is a recently proposed open-world task. We propose a co-training-based framework that encourages clustering consistency. Our method achieves state-of-the-art performance on three generic benchmarks and three fine-grained visual recognition datasets.
  arXiv  Detail & Related papers  (2023-10-30T00:32:47Z)
• Dynamic Conceptional Contrastive Learning for Generalized Category Discovery [76.82327473338734]
  Generalized category discovery (GCD) aims to automatically cluster partially labeled data. Unlabeled data contain instances that are not only from known categories of the labeled data but also from novel categories. One effective way for GCD is applying self-supervised learning to learn discriminate representation for unlabeled data. We propose a Dynamic Conceptional Contrastive Learning framework, which can effectively improve clustering accuracy.
  arXiv  Detail & Related papers  (2023-03-30T14:04:39Z)
• Open World Classification with Adaptive Negative Samples [89.2422451410507]
  Open world classification is a task in natural language processing with key practical relevance and impact. We propose an approach based on underlineadaptive underlinesamples (ANS) designed to generate effective synthetic open category samples in the training stage. ANS achieves significant improvements over state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-09T21:12:46Z)
• Cluster-to-adapt: Few Shot Domain Adaptation for Semantic Segmentation across Disjoint Labels [80.05697343811893]
  Cluster-to-Adapt (C2A) is a computationally efficient clustering-based approach for domain adaptation across segmentation datasets. We show that such a clustering objective enforced in a transformed feature space serves to automatically select categories across source and target domains.
  arXiv  Detail & Related papers  (2022-08-04T17:57:52Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)
• Exploring Category-Agnostic Clusters for Open-Set Domain Adaptation [138.29273453811945]
  We present Self-Ensembling with Category-agnostic Clusters (SE-CC) -- a novel architecture that steers domain adaptation with category-agnostic clusters in target domain. clustering is performed over all the unlabeled target samples to obtain the category-agnostic clusters, which reveal the underlying data space structure peculiar to target domain.
  arXiv  Detail & Related papers  (2020-06-11T16:19:02Z)
• CycleCluster: Modernising Clustering Regularisation for Deep Semi-Supervised Classification [0.0]
  We propose a novel framework, CycleCluster, for deep semi-supervised classification. Our core optimisation is driven by a new clustering based regularisation along with a graph based pseudo-labels and a shared deep network.
  arXiv  Detail & Related papers  (2020-01-15T13:34:02Z)

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.