AdaptGCD: Multi-Expert Adapter Tuning for Generalized Category Discovery

• URL: http://arxiv.org/abs/2410.21705v2
• Date: Fri, 14 Mar 2025 15:55:43 GMT
• Title: AdaptGCD: Multi-Expert Adapter Tuning for Generalized Category Discovery
• Abstract summary: Generalized Category Discovery aims to classify old categories and discover new categories in the unlabeled data.<n>Existing studies on GCD typically devote to transferring the general knowledge from the self-supervised pretrained model to the target GCD task.<n>We propose a novel adapter-tuning-based method named AdaptGCD, which is the first work to introduce the adapter tuning into the GCD task.
• Score: 15.640670797555579
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Different from the traditional semi-supervised learning paradigm that is constrained by the close-world assumption, Generalized Category Discovery (GCD) presumes that the unlabeled dataset contains new categories not appearing in the labeled set, and aims to not only classify old categories but also discover new categories in the unlabeled data. Existing studies on GCD typically devote to transferring the general knowledge from the self-supervised pretrained model to the target GCD task via some fine-tuning strategies, such as partial tuning and prompt learning. Nevertheless, these fine-tuning methods fail to make a sound balance between the generalization capacity of pretrained backbone and the adaptability to the GCD task. To fill this gap, in this paper, we propose a novel adapter-tuning-based method named AdaptGCD, which is the first work to introduce the adapter tuning into the GCD task and provides some key insights expected to enlighten future research. Furthermore, considering the discrepancy of supervision information between the old and new classes, a multi-expert adapter structure equipped with a route assignment constraint is elaborately devised, such that the data from old and new classes are separated into different expert groups. Extensive experiments are conducted on 7 widely-used datasets. The remarkable improvements in performance highlight the effectiveness of our proposals.

Related papers

• Sparsity Hurts: Simple Linear Adapter Can Boost Generalized Category Discovery [54.695641187741536]
  Generalized Category Discovery (GCD) seeks to identify novel categories from unlabeled data.<n>Prior GCD methods commonly leverage transferable representations from pre-trained models.<n>We propose LAGCD, a simple yet effective GCD approach that embeds a residual linear adapter into each ViT block.
  arXiv  Detail & Related papers  (2026-05-05T10:14:30Z)
• Adapting Vision-Language Models Without Labels: A Comprehensive Survey [74.17944178027015]
  Vision-Language Models (VLMs) have demonstrated remarkable generalization capabilities across a wide range of tasks.<n>Recent research has increasingly focused on unsupervised adaptation methods that do not rely on labeled data.<n>We propose a taxonomy based on the availability and nature of unlabeled visual data, categorizing existing approaches into four key paradigms.
  arXiv  Detail & Related papers  (2025-08-07T16:27:37Z)
• Consistent Supervised-Unsupervised Alignment for Generalized Category Discovery [49.67913741459179]
  Generalized Category Discovery (GCD) focuses on classifying known categories while simultaneously discovering novel categories from unlabeled data.<n>Previous GCD methods face challenges due to inconsistent optimization objectives and category confusion.<n>We propose the Neural Collapse-inspired Generalized Category Discovery (NC-GCD) framework.
  arXiv  Detail & Related papers  (2025-07-07T07:34:41Z)
• Few-shot Novel Category Discovery [19.350477820997924]
  Novel Category Discovery (NCD) adapt paradigm of transductive learning hinders its application in more real-world scenarios.<n>This paper presents a new setting in which a trained agent is able to flexibly switch between the tasks of identifying examples of known (labelled) classes and clustering novel (completely unlabeled) classes.
  arXiv  Detail & Related papers  (2025-05-13T06:18:03Z)
• ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discovery [42.965641047139904]
  Generalized category discovery (GCD) is a pragmatic but underexplored problem. Unlabeled data contain both old and new classes. ProtoGCD achieves state-of-the-art performance on both generic and fine-grained datasets.
  arXiv  Detail & Related papers  (2025-04-02T06:13:14Z)
• When Domain Generalization meets Generalized Category Discovery: An Adaptive Task-Arithmetic Driven Approach [29.664356718958803]
  Generalized Class Discovery (GCD) clusters base and novel classes in a target domain using supervision from a source domain with only base classes. We introduce the novel paradigm of Domain Generalization in GCD (DG-GCD), where only source data is available for training. Our solution, DG2CD-Net, aims to construct a domain-independent, discriminative embedding space for GCD.
  arXiv  Detail & Related papers  (2025-03-19T04:48:16Z)
• Solving the Catastrophic Forgetting Problem in Generalized Category Discovery [46.63232918739251]
  Generalized Category Discovery (GCD) aims to identify a mix of known and novel categories within unlabeled data sets. Recent state-of-the-art method SimGCD transfers the knowledge from known-class data to the learning of novel classes through debiased learning. We propose a novel learning approach, LegoGCD, which is seamlessly integrated into previous methods to enhance the discrimination of novel classes.
  arXiv  Detail & Related papers  (2025-01-09T14:31:54Z)
• HG-Adapter: Improving Pre-Trained Heterogeneous Graph Neural Networks with Dual Adapters [53.97380482341493]
  "pre-train, prompt-tuning" has demonstrated impressive performance for tuning pre-trained heterogeneous graph neural networks (HGNNs) We propose a unified framework that combines two new adapters with potential labeled data extension to improve the generalization of pre-trained HGNN models.
  arXiv  Detail & Related papers  (2024-11-02T06:43:54Z)
• Happy: A Debiased Learning Framework for Continual Generalized Category Discovery [54.54153155039062]
  This paper explores the underexplored task of Continual Generalized Category Discovery (C-GCD) C-GCD aims to incrementally discover new classes from unlabeled data while maintaining the ability to recognize previously learned classes. We introduce a debiased learning framework, namely Happy, characterized by Hardness-aware prototype sampling and soft entropy regularization.
  arXiv  Detail & Related papers  (2024-10-09T04:18:51Z)
• Active Generalized Category Discovery [60.69060965936214]
  Generalized Category Discovery (GCD) endeavors to cluster unlabeled samples from both novel and old classes. We take the spirit of active learning and propose a new setting called Active Generalized Category Discovery (AGCD) Our method achieves state-of-the-art performance on both generic and fine-grained datasets.
  arXiv  Detail & Related papers  (2024-03-07T07:12:24Z)
• Generalized Categories Discovery for Long-tailed Recognition [8.69033435074757]
  Generalized Class Discovery plays a pivotal role in discerning both known and unknown categories from unlabeled datasets. Our research endeavors to bridge this disconnect by focusing on the long-tailed Generalized Category Discovery (Long-tailed GCD) paradigm. In response to the unique challenges posed by Long-tailed GCD, we present a robust methodology anchored in two strategic regularizations.
  arXiv  Detail & Related papers  (2023-12-04T09:21:30Z)
• Category Adaptation Meets Projected Distillation in Generalized Continual Category Discovery [0.9349784561232036]
  Generalized Continual Category Discovery (GCCD) tackles learning from sequentially arriving, partially labeled datasets. We introduce a novel technique integrating a learnable projector with feature distillation, thus enhancing model adaptability without sacrificing past knowledge. We demonstrate that while each component offers modest benefits individually, their combination - dubbed CAMP - significantly improves the balance between learning new information and retaining old.
  arXiv  Detail & Related papers  (2023-08-23T13:02:52Z)
• 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)
• Guiding Generative Language Models for Data Augmentation in Few-Shot Text Classification [59.698811329287174]
  We leverage GPT-2 for generating artificial training instances in order to improve classification performance. Our results show that fine-tuning GPT-2 in a handful of label instances leads to consistent classification improvements.
  arXiv  Detail & Related papers  (2021-11-17T12:10:03Z)
• Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification [94.55805516167369]
  We propose a new approach for binary classification from m U-sets for $mge2$. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
  arXiv  Detail & Related papers  (2021-02-01T07:36:38Z)

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.