InfoSculpt: Sculpting the Latent Space for Generalized Category Discovery
Not on the map. Why?
Abstract (arXiv)
Generalized Category Discovery (GCD) aims to classify instances from both known and novel categories within a large-scale unlabeled dataset, a critical yet challenging task for real-world, open-world applications. However, existing methods often rely on pseudo-labeling, or two-stage clustering, which lack a principled mechanism to explicitly disentangle essential, category-defining signals from instance-specific noise. In this paper, we address this fundamental limitation by re-framing GCD from an information-theoretic perspective, grounded in the Information Bottleneck (IB) principle. We introduce InfoSculpt, a novel framework that systematically sculpts the representation space by minimizing a dual Conditional Mutual Information (CMI) objective. InfoSculpt uniquely combines a Category-Level CMI on labeled data to learn compact and discriminative representations for known classes, and a complementary Instance-Level CMI on all data to distill invariant features by compressing augmentation-induced noise. These two objectives work synergistically at different scales to produce a disentangled and robust latent space where categorical information is preserved while noisy, instance-specific details are discarded. Extensive experiments on 8 benchmarks demonstrate that InfoSculpt validating the effectiveness of our information-theoretic approach.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 41 references that are in the map. First posted on arXiv 15 Jan 2026.
Builds on
29 of 41 references.
References · 29
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2020Supervised Contrastive Learningcited by 2,829
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
- 2019Contrastive Multiview Codingcited by 1,301
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2018Recent Advances in Open Set Recognition: A Surveycited by 310
- 2022Generalized Category Discoverycited by 211
17 more
- 2021A Unified Objective for Novel Class Discoverycited by 162
- 2017Batch Renormalization: Towards Reducing Minibatch Dependence in Batch-Normalized Modelscited by 128
- 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116
- 2022Parametric Classification for Generalized Category Discovery: A Baseline Studycited by 113
- 2023Dynamic Conceptional Contrastive Learning for Generalized Category Discoverycited by 92
- 2023Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discoverycited by 72
- 2024SPTNet: An Efficient Alternative Framework for Generalized Category Discovery with Spatial Prompt Tuningcited by 51
- 2022XCon: Learning with Experts for Fine-grained Category Discoverycited by 50
- 2023Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discoverycited by 39
- 2024Contrastive Mean-Shift Learning for Generalized Category Discoverycited by 39
- 2024Active Generalized Category Discoverycited by 31
- 2024Open-world machine learning: A review and new outlookscited by 27
- 2025Solving the Catastrophic Forgetting Problem in Generalized Category Discoverycited by 26
- 2025Hyperbolic Category Discoverycited by 20
- 2025ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discoverycited by 19
- 2023Conditional Mutual Information Constrained Deep Learning for Classificationcited by 18
- 2025Generalized Category Discovery via Token Manifold Capacity Learningcited by 3
Built on by
Not cited yet.