CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddings
Not on the map. Why?
Abstract (arXiv)
We propose CLoVE (Clustering of Loss Vector Embeddings), a novel algorithm for Clustered Federated Learning (CFL). In CFL, clients are naturally grouped into clusters based on their data distribution. However, identifying these clusters is challenging, as client assignments are unknown. CLoVE utilizes client embeddings derived from model losses on client data, and leverages the insight that clients in the same cluster share similar loss values, while those in different clusters exhibit distinct loss patterns. Based on these embeddings, CLoVE is able to iteratively identify and separate clients from different clusters and optimize cluster-specific models through federated aggregation. Key advantages of CLoVE over existing CFL algorithms are (1) its simplicity, (2) its applicability to both supervised and unsupervised settings, and (3) the fact that it eliminates the need for near-optimal model initialization, which makes it more robust and better suited for real-world applications. We establish theoretical convergence bounds, showing that CLoVE can recover clusters accurately with high probability in a single round and converges exponentially fast to optimal models in a linear setting. Our comprehensive experiments comparing with a variety of both CFL and generic Personalized Federated Learning (PFL) algorithms on different types of datasets and an extensive array of non-IID settings demonstrate that CLoVE achieves highly accurate cluster recovery in just a few rounds of training, along with state-of-the-art model accuracy, across a variety of both supervised and unsupervised PFL tasks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 50 references that are in the map. First posted on arXiv 27 Jun 2025.
Builds on
30 of 50 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
- 2018Federated Learning with Non-IID Datacited by 1,108
- 2019Towards Federated Learning at Scale: System Designcited by 832
- 2018LEAF: A Benchmark for Federated Settingscited by 792
- 2017Federated Multi-Task Learningcited by 672
- 2020An Efficient Framework for Clustered Federated Learningcited by 511
18 more
- 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
- 2021Towards Personalized Federated Learningcited by 464
- 2020Adaptive Personalized Federated Learningcited by 358
- 2021FedProto: Federated Prototype Learning across Heterogeneous Clientscited by 352
- 2020Three Approaches for Personalization with Applications to Federated Learningcited by 325
- 2019Improving Federated Learning Personalization via Model Agnostic Meta Learningcited by 269
- 2020Federated Learning of a Mixture of Global and Local Modelscited by 210
- 2022FedALA: Adaptive Local Aggregation for Personalized Federated Learningcited by 122
- 2021Multi-Center Federated Learning: Clients Clustering for Better Personalizationcited by 113
- 2019Efficient Parameter-free Clustering Using First Neighbor Relationscited by 97
- 2023Personalized Federated Learning with Feature Alignment and Classifier Collaborationcited by 97
- 2021Heterogeneity for the Win: One-Shot Federated Clusteringcited by 87
- 2021Flexible Clustered Federated Learning for Client-Level Data Distribution Shiftcited by 47
- 2022Efficient Distribution Similarity Identification in Clustered Federated Learning via Principal Angles Between Client Data Subspacescited by 36
- 2023Provably Personalized and Robust Federated Learningcited by 11
- 2024Spectral Co-Distillation for Personalized Federated Learningcited by 8
- 2025Interaction-Aware Gaussian Weighting for Clustered Federated Learningcited by 5
- 2013Alternating Minimization for Mixed Linear Regressioncited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.