English

ClearGCD: Mitigating Shortcut Learning For Robust Generalized Category Discovery

Computer Vision and Pattern Recognition 2025-12-01 v1 Machine Learning

Abstract

In open-world scenarios, Generalized Category Discovery (GCD) requires identifying both known and novel categories within unlabeled data. However, existing methods often suffer from prototype confusion caused by shortcut learning, which undermines generalization and leads to forgetting of known classes. We propose ClearGCD, a framework designed to mitigate reliance on non-semantic cues through two complementary mechanisms. First, Semantic View Alignment (SVA) generates strong augmentations via cross-class patch replacement and enforces semantic consistency using weak augmentations. Second, Shortcut Suppression Regularization (SSR) maintains an adaptive prototype bank that aligns known classes while encouraging separation of potential novel ones. ClearGCD can be seamlessly integrated into parametric GCD approaches and consistently outperforms state-of-the-art methods across multiple benchmarks.

Keywords

Cite

@article{arxiv.2511.22892,
  title  = {ClearGCD: Mitigating Shortcut Learning For Robust Generalized Category Discovery},
  author = {Kailin Lyu and Jianwei He and Long Xiao and Jianing Zeng and Liang Fan and Lin Shu and Jie Hao},
  journal= {arXiv preprint arXiv:2511.22892},
  year   = {2025}
}

Comments

5 pages, 4 figures

R2 v1 2026-07-01T07:58:49.212Z