MetaGCD: Learning to Continually Learn in Generalized Category Discovery

• URL: http://arxiv.org/abs/2308.11063v2
• Date: Tue, 17 Oct 2023 18:13:48 GMT
• Title: MetaGCD: Learning to Continually Learn in Generalized Category Discovery
• Authors: Yanan Wu, Zhixiang Chi, Yang Wang, Songhe Feng
• Abstract summary: We consider a real-world scenario where a model that is trained on pre-defined classes continually encounters unlabeled data. The goal is to continually discover novel classes while maintaining the performance in known classes. We propose an approach, called MetaGCD, to learn how to incrementally discover with less forgetting.
• Score: 26.732455383707798
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: In this paper, we consider a real-world scenario where a model that is trained on pre-defined classes continually encounters unlabeled data that contains both known and novel classes. The goal is to continually discover novel classes while maintaining the performance in known classes. We name the setting Continual Generalized Category Discovery (C-GCD). Existing methods for novel class discovery cannot directly handle the C-GCD setting due to some unrealistic assumptions, such as the unlabeled data only containing novel classes. Furthermore, they fail to discover novel classes in a continual fashion. In this work, we lift all these assumptions and propose an approach, called MetaGCD, to learn how to incrementally discover with less forgetting. Our proposed method uses a meta-learning framework and leverages the offline labeled data to simulate the testing incremental learning process. A meta-objective is defined to revolve around two conflicting learning objectives to achieve novel class discovery without forgetting. Furthermore, a soft neighborhood-based contrastive network is proposed to discriminate uncorrelated images while attracting correlated images. We build strong baselines and conduct extensive experiments on three widely used benchmarks to demonstrate the superiority of our method.

Related papers

• 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)
• Class-relation Knowledge Distillation for Novel Class Discovery [16.461242381109276]
  Key challenge lies in transferring the knowledge in the known-class data to the learning of novel classes. We introduce a class relation representation for the novel classes based on the predicted class distribution of a model trained on known classes. We propose a novel knowledge distillation framework, which utilizes our class-relation representation to regularize the learning of novel classes.
  arXiv  Detail & Related papers  (2023-07-18T11:35:57Z)
• 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)
• PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discovery [39.03732147384566]
  Generalized Novel Category Discovery (GNCD) setting aims to categorize unlabeled training data coming from known and novel classes. We propose Contrastive Affinity Learning method with auxiliary visual Prompts, dubbed PromptCAL, to address this challenging problem. Our approach discovers reliable pairwise sample affinities to learn better semantic clustering of both known and novel classes for the class token and visual prompts.
  arXiv  Detail & Related papers  (2022-12-11T20:06:14Z)
• A Method for Discovering Novel Classes in Tabular Data [54.11148718494725]
  In Novel Class Discovery (NCD), the goal is to find new classes in an unlabeled set given a labeled set of known but different classes. We show a way to extract knowledge from already known classes to guide the discovery process of novel classes in heterogeneous data.
  arXiv  Detail & Related papers  (2022-09-02T11:45:24Z)
• Novel Class Discovery without Forgetting [72.52222295216062]
  We identify and formulate a new, pragmatic problem setting of NCDwF: Novel Class Discovery without Forgetting. We propose a machine learning model to incrementally discover novel categories of instances from unlabeled data. We introduce experimental protocols based on CIFAR-10, CIFAR-100 and ImageNet-1000 to measure the trade-off between knowledge retention and novel class discovery.
  arXiv  Detail & Related papers  (2022-07-21T17:54:36Z)
• Class-incremental Novel Class Discovery [76.35226130521758]
  We study the new task of class-incremental Novel Class Discovery (class-iNCD) We propose a novel approach for class-iNCD which prevents forgetting of past information about the base classes. Our experiments, conducted on three common benchmarks, demonstrate that our method significantly outperforms state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-07-18T13:49:27Z)
• Open-World Semi-Supervised Learning [66.90703597468377]
  We introduce a new open-world semi-supervised learning setting in which the model is required to recognize previously seen classes. We propose ORCA, an approach that learns to simultaneously classify and cluster the data. We demonstrate that ORCA accurately discovers novel classes and assigns samples to previously seen classes on benchmark image classification datasets.
  arXiv  Detail & Related papers  (2021-02-06T07:11:07Z)

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.