paper-with-me

홈 › Papers

Unleashing the Potential of Model Bias for Generalized Category Discovery

2024-12-17 · Wenbin An, Haonan Lin, Jiahao Nie, Feng Tian, Wenkai Shi, Yaqiang Wu, Qianying Wang, Ping Chen

Generalized Category Discovery is a significant and complex task that aims to identify both known and undefined novel categories from a set of unlabeled data, leveraging another labeled dataset containing only known categories. The primary challenges stem from model bias induced by pre-training on only known categories and the lack of precise supervision for novel ones, leading to category bias towards known categories and category confusion among different novel categories, which hinders models' ability to identify novel categories effectively. To address these challenges, we propose a novel framework named Self-Debiasing Calibration (SDC). Unlike prior methods that regard model bias towards known categories as an obstacle to novel category identification, SDC provides a novel insight into unleashing the potential of the bias to facilitate novel category learning. Specifically, the output of the biased model serves two key purposes. First, it provides an accurate modeling of category bias, which can be utilized to measure the degree of bias and debias the output of the current training model. Second, it offers valuable insights for distinguishing different novel categories by transferring knowledge between similar categories. Based on these insights, SDC dynamically adjusts the output logits of the current training model using the output of the biased model. This approach produces less biased logits to effectively address the issue of category bias towards known categories, and generates more accurate pseudo labels for unlabeled data, thereby mitigating category confusion for novel categories. Experiments on three benchmark datasets show that SDC outperforms SOTA methods, especially in the identification of novel categories. Our code and data are available at \url{https://github.com/Lackel/SDC}.

📄 PDF Abstract BibTeX arXiv:2412.12501

Code (1)

lackel/sdc 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

DIG-FACE: De-biased Learning for Generalized Facial Expression Category Discovery

2024-09-30 · Tingzhang Luo, Yichao Liu, Yuanyuan Liu, Andi Zhang 외

We introduce a novel task, Generalized Facial Expression Category Discovery (G-FACE), that discovers new, unseen facial expressions while recognizing known categories effectively. Even though there are generalized catego…

Facial Expression RecognitionTriplet

Virtual Category-Guided Continual Generalized Category Discovery

2026-07-06 · Jiahui Xiong, Qiuxia Lai, Hongsong Wang arxiv

Continual Generalized Category Discovery (C-GCD) aims to incrementally identify novel categories from sequential unlabeled data while preserving recognition of known classes, which is an essential capability for open-wor…

Contrastive Learning

ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discovery

2025-04-02 · Shijie Ma, Fei Zhu, Xu-Yao Zhang, Cheng-Lin Liu

Generalized category discovery (GCD) is a pragmatic but underexplored problem, which requires models to automatically cluster and discover novel categories by leveraging the labeled samples from old classes. The challeng…

Contrastive Learning

MedXplore: Towards Reliable and Unbiased Generalized Category Discovery in Medical Imaging

2026-07-30 · Jianwei He, Kailin Lyu, Junhao Dong, Long Xiao 외 arxiv

Deep learning has shown strong potential in medical image analysis, but most existing methods rely on large-scale annotations and a closed-world assumption that rarely holds in clinical practice. Although Generalized Cat…

Representation Learning

Parametric Information Maximization for Generalized Category Discovery

2022-12-01 · ICCV 2023 1 · Florent Chiaroni, Jose Dolz, Ziko Imtiaz Masud, Amar Mitiche 외

We introduce a Parametric Information Maximization (PIM) model for the Generalized Category Discovery (GCD) problem. Specifically, we propose a bi-level optimization formulation, which explores a parameterized family of …