Discovering Collaboration from Novelty: Random Network Distillation for Clustered Federated Learning
This addresses the challenge of non-IID data in federated learning by enabling autonomous, task-agnostic client grouping without prior knowledge of cluster structure.
The paper proposes a lightweight clustering method for federated learning using Random Network Distillation to group similar clients before training, decoupling clustering from the main learning loop to reduce computational and communication costs.
Federated Learning often suffers under non-independently and identically distributed data, where a single global model may fail to represent the diversity of client distributions. Clustered Federated Learning mitigates this issue by training specialized models for groups of similar clients, but existing approaches often couple cluster assignment with the main training loop, increasing computational and communication costs. We propose a lightweight clustering approach based on Random Network Distillation. Each client trains a compact Random Network Distillation predictor on its local data and uses its prediction error as a novelty signal to estimate similarity with other clients. This enables the discovery of meaningful client groups before federated training, without sharing raw data or repeatedly evaluating the main model. Crucially, the resulting federations emerge from local novelty estimates at runtime, making the method suitable for autonomous large-scale distributed systems where neither the number of clusters nor the collaboration structure can be specified a priori. Overall, by decoupling clustering from learning, the method provides a task-agnostic and efficient mechanism for autonomous collaboration under non-independently and identically distributed data.