Introduction
Generalized Class Discovery (GCD) is a critical task in open-world machine learning, where a model must categorize data from both known classes (seen during training) and novel classes (unseen) within an unlabeled pool. Existing "one-stage" methods typically rely on clustering algorithms like $k$-means to identify class prototypes. However, these approaches suffer from two primary limitations: the "shrunk prototype" problem and significant computational overhead.
The "shrunk prototype" problem occurs when clustering algorithms conservatively estimate fewer clusters than actually exist, leading to "blurred" semantics where multiple distinct novel classes are collapsed into a single prototype. Furthermore, clustering the entire combined labeled and unlabeled dataset becomes a bottleneck as data scales.
The Probing New Prototype (PNP) Framework
To address these challenges, we propose the Probing New Prototype (PNP) framework. PNP decouples the discovery process and introduces learnable "potential prototypes" to recover missing classes.
1. Unlabeled Data Oriented Fast Clustering
Unlike traditional methods that cluster the full dataset, PNP focuses exclusively on unlabeled data. It utilizes Infomap, a fast graph-based clustering algorithm, to generate an initial set of cluster prototypes. This targeted approach significantly reduces the search space and improves efficiency.
2. Potential Prototype Probing
To counteract the underestimation of class counts, PNP injects "potential prototypes"—extra, randomly initialized learnable tensors. These act as placeholders for novel classes that the initial clustering phase might have overlooked.
3. Self-Distilled Prototype Learning
Since ground truth labels for novel classes are unavailable, PNP employs a Student-Teacher framework. A "Teacher" model generates soft probability distributions representing how instances relate to the expanded set of prototypes. The "Student" model is then trained to match these predictions, effectively refining the potential prototypes into meaningful class centers through self-distillation.
Experimental Evaluation
PNP was evaluated across seven diverse benchmarks, including generic datasets (CIFAR10/100, ImageNet100) and fine-grained datasets (CUB200, Stanford Cars, FGVC-Aircraft, Herbarium 19).
Performance and Efficiency
PNP achieved state-of-the-art results, notably outperforming existing methods on the Stanford Cars dataset by 9.7% in overall accuracy. On the large-scale Herbarium 19 dataset, PNP demonstrated a 12x speedup in the clustering stage compared to the previous state-of-the-art (DCCL), reducing processing time from 25 minutes to just 2 minutes.
Class Estimation
Visualization via t-SNE confirms that PNP's probing mechanism discovers a number of clusters much closer to the ground truth. For instance, it identified 183 clusters in a 200-class dataset, whereas standard methods found only 175.
Discussion and Limitations
While PNP excels in complex, fine-grained scenarios, it can occasionally overestimate the number of categories in simpler datasets like CIFAR10, leading to "over-splitting." Additionally, performance is sensitive to the number of neighbors ($k$) used in graph construction. Future research will explore adaptive neighbor selection to enhance robustness across varying data distributions.
Summary updated