Aug 2026· 2026 12th International Conference on Big Data and Information Analytics (BigDIA)· pp. 351-357· 0 citations· 24 references
Abstract
Generalized Category Discovery (GCD) requires a model to recognize labeled seen classes while discovering unlabeled novel classes from partially annotated data. This paper argues that a key difficulty comes from bias that accumulates during optimization. Two effects appear repeatedly in practice: feature response imbalance, where representations concentrate on a few high-activation dimensions, and prediction confidence shift, where the classifier becomes too confident on seen classes and pulls novel samples into known categories. To counter these effects, this paper proposes BiGCD, a bias-aware framework that regularizes both representations and predictions. BiGCD applies a Structural Suppression Module to dampen dominant feature dimensions and a Label Suppression Module to prevent overly peaked output distributions, and it activates the label-side regularization after a warm-up period to keep training stable. The modules are lightweight and can be plugged into existing GCD pipelines without adding learnable parameters. Experiments on CIFAR10, CIFAR100, Stanford Cars, FGVC-Aircraft, and Herbarium19 show consistent gains over strong baselines, with especially large improvements on seen-class recognition in fine-grained settings. Ablation studies further show that the two modules contribute independently and work better together.
Long-tailed image datasets often produce classifiers that appear reliable under average accuracy but remain fragile on rare visual categories. Existing reweighting and focal-style objectives reduce this bias from label counts or prediction loss, yet they do not explicitly measure whether a minority-class embedding is d...
Jun-Chen Liu· 2026 7th International Confe...· 0 citations
Generalized Category Discovery (GCD) assigns unlabeled instances, mixed with labeled data, to known or novel categories, requiring human-like compositional reasoning: reusing primitives learned from known classes and deciding when new combinations imply new categories. Existing GCD methods operate on unstructured token...
Lu-Yao Tang, Jie-Wei Zheng, Kun-Ze Huang et al.· 2 citations
Predicting whether a trained model will generalize under distribution shift remains difficult, especially when target-domain data are unavailable. We introduce STAMP (Semantic Temporal Augmented Model Prediction), a source-only, target-label-free criterion that estimates out-of-distribution (OOD) performance from paire...
Generalized Category Discovery (GCD) is an intriguing open-world problem that has garnered increasing attention: given partially labelled data, the goal is to correctly recognize known classes while discovering coherent novel categories from unlabelled samples. Recent GCD methods typically adapt foundation models by jo...
Yuan-Pei Liu, Zhenqi He, Jiawei Tang et al.· 0 citations
Fine-grained recognition often involves hierarchical label spaces, where a model may be confident about a coarse semantic concept while remaining uncertain among its descendant classes. Such structured ambiguity requires uncertainty representations that capture both fine-grained classes and intermediate concepts. Howev...
This paper introduces three modular components: an attention mechanism that weights the contribution of retrieved cases, a locality-aware regularizer that favors label-similar neighbors, and an optional case adaptation module that refines the retrieved estimate.
Xiaomeng Ye, Yu Wang, David B. Leake et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.