Mutual Information-based Generalized Category Discovery

12/01/2022
by   Florent Chiaroni, et al.
0

We introduce an information-maximization approach for the Generalized Category Discovery (GCD) problem. Specifically, we explore a parametric family of loss functions evaluating the mutual information between the features and the labels, and find automatically the one that maximizes the predictive performances. Furthermore, we introduce the Elbow Maximum Centroid-Shift (EMaCS) technique, which estimates the number of classes in the unlabeled set. We report comprehensive experiments, which show that our mutual information-based approach (MIB) is both versatile and highly competitive under various GCD scenarios. The gap between the proposed approach and the existing methods is significant, more so when dealing with fine-grained classification problems. Our code: <https://github.com/fchiaroni/Mutual-Information-Based-GCD>.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset