Bures-Isotropy Alignment: Manifold Learning of Generalized Category Discovery
Luyao Tang, Kunze Huang, Chaoqi Chen, Cheng Chen
Abstract
Generalized Category Discovery (GCD) seeks to discover categories by clustering unlabeled samples that mix known and novel classes. While the prevailing recipe enforces compact clustering, this pursuit is largely blind to representation geometry: it over-compresses token manifolds, distorts eigen-structure, and yields brittle feature distributions that undermine discovery. We argue that GCD requires not more compression, but geometric restoration of an over-flattened feature space. Drawing inspiration from quantum information science, which similarly pursues representational completeness, we introduce Bures-Isotropy Alignment (BIA), which optimizes the mini-batch class-token Gram toward an isotropic prior by minimizing the Bures distance. Under a mild trace constraint, BIA admits a practical surrogate equivalent to maximizing the nuclear norm of stacked class tokens, thereby promoting isotropic, non-collapsed subspaces without altering architectures. The induced isotropy homogenizes the eigen-spectrum and raises the von Neumann entropy, improving both cluster separability and class-number estimation. BIA is plug-and-play, implemented in a few lines on unlabeled batches, and generally boosts strong GCD baselines on coarse- and fine-grained benchmarks, improving overall accuracy and reducing errors in the estimation of class-number. By restoring the geometry of token manifolds rather than compressing them blindly, BIA supplies compactness for known classes and cohesive emergence for novel ones, advancing robust open-world discovery. Code is available at github.com/lytang63/BIA.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ceacafd0-2554-4b52-8ea8-93568be95a94Cited by top-tier papers3
- PRISM: Progressive Robust Learning for Open-World Continual Category DiscoveryWei Feng, Sijin Zhou, Yiwen Jiang, Zongyuan GeICLR 2026
- Task-Driven Subspace Decomposition for Knowledge Sharing and Isolation in LoRA-based Continual LearningLingfeng He, De Cheng, Huaijie Wang, Xi Yang et al.ICML 2026
- CoGe-GCD: Reframing Generalized Category Discovery with Compositional GeneralizationLuyao Tang, Jiewei Zheng, Kunze Huang, Chaoqi Chen et al.ICML 2026
Builds on25
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- An Image is Worth 16x16 Words: Transformers for Image Recognition at ScaleAlexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn et al.ICLR 2021 · 21,477 citations
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec et al.NeurIPS 2020 · 9,171 citations
- Emerging Properties in Self-Supervised Vision TransformersMathilde Caron, Hugo Touvron, Ishan Misra, Hervé Jégou et al.ICCV 2021 · 8,921 citations
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
Related papers
- Consistent Supervised-Unsupervised Alignment for Generalized Category DiscoveryJizhou Han, Shaokun Wang, Yuhang He, Chenhao Ding et al.NeurIPS 2025 · 7 citations
- The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category DiscoveryHaiyang Zheng, Nan Pu, Yaqi Cai, Teng Long et al.CVPR 2026 · 1 citation
- Identifying Latent Concepts and Structures for Generalized Category DiscoveryBoyang Dai, Chaoqi Chen, Yizhou YuICML 2026
- Parametric Classification for Generalized Category Discovery: A Baseline StudyXin Wen, Bingchen Zhao, Xiaojuan QiICCV 2023 · 152 citations
- Prior-Constrained Association Learning for Fine-Grained Generalized Category DiscoveryMenglin Wang, Zhun Zhong, Xiaojin GongAAAI 2025 · 4 citations
