Federated Generalized Category Discovery
Nan Pu, Zhun Zhong, Xinyuan Ji, Nicu Sebe

TL;DR
This paper introduces Federated GCD, a privacy-preserving framework for discovering known and unknown categories across distributed clients, using a novel contrastive learning approach with Gaussian mixture models.
Contribution
It proposes a new federated learning framework for generalized category discovery, incorporating a Gaussian contrastive learning method with client-server category aggregation.
Findings
AGCL outperforms FedAvg baseline on all datasets
The framework effectively handles heterogeneous label spaces
The method improves representation robustness with limited local data
Abstract
Generalized category discovery (GCD) aims at grouping unlabeled samples from known and unknown classes, given labeled data of known classes. To meet the recent decentralization trend in the community, we introduce a practical yet challenging task, namely Federated GCD (Fed-GCD), where the training data are distributively stored in local clients and cannot be shared among clients. The goal of Fed-GCD is to train a generic GCD model by client collaboration under the privacy-protected constraint. The Fed-GCD leads to two challenges: 1) representation degradation caused by training each client model with fewer data than centralized GCD learning, and 2) highly heterogeneous label spaces across different clients. To this end, we propose a novel Associated Gaussian Contrastive Learning (AGCL) framework based on learnable GMMs, which consists of a Client Semantics Association (CSA) and a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsText and Document Classification Technologies · Domain Adaptation and Few-Shot Learning · Data-Driven Disease Surveillance
MethodsContrastive Learning
