Provably Personalized and Robust Federated Learning
Not on the map. Why?
Abstract (arXiv)
Identifying clients with similar objectives and learning a model-per-cluster is an intuitive and interpretable approach to personalization in federated learning. However, doing so with provable and optimal guarantees has remained an open challenge. We formalize this problem as a stochastic optimization problem, achieving optimal convergence rates for a large class of loss functions. We propose simple iterative algorithms which identify clusters of similar clients and train a personalized model-per-cluster, using local client gradients and flexible constraints on the clusters. The convergence rates of our algorithms asymptotically match those obtained if we knew the true underlying clustering of the clients and are provably robust in the Byzantine setting where some fraction of the clients are malicious.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 14 Jun 2023.
Builds on
24 of 33 references.
References · 24
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2017Federated Multi-Task Learningcited by 672
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 634
- 2020An Efficient Framework for Clustered Federated Learningcited by 511
- 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
- 2021Towards Personalized Federated Learningcited by 464
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
- 2020Three Approaches for Personalization with Applications to Federated Learningcited by 325
- 2019Robust Aggregation for Federated Learningcited by 317
12 more
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
- 2021Federated Multi-Task Learning under a Mixture of Distributionscited by 192
- 2020Survey of Personalization Techniques for Federated Learningcited by 145
- 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
- 2019Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulationcited by 141
- 2020Learning from History for Byzantine Robust Optimizationcited by 137
- 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 128
- 2021Personalized Federated Learning through Local Memorizationcited by 57
- 2021Optimality and Stability in Federated Learning: A Game-theoretic Approachcited by 40
- 2023Personalized Federated Learning under Mixture of Distributionscited by 37
- 2022Personalized Federated Learning via Heterogeneous Modular Networkscited by 8
Built on by
Citing papers per year: 2024: 8; 2025: 2; 2026: 1.
11 papers.
- 2024Noise-Aware Algorithm for Heterogeneous Differentially Private Federated Learningcited by 9
- 2024CoBo: Collaborative Learning via Bilevel Optimizationcited by 5
- 2024Fine-Tuning Personalization in Federated Learning to Mitigate Adversarial Clientscited by 5
- 2024Distributionally Robust Clustered Federated Learning: A Case Study in Healthcarecited by 2
- 2025Adaptive collaboration for online personalized distributed learning with heterogeneous clientscited by 2
- 2024Collaborative and Efficient Personalization with Mixtures of Adaptorscited by 1
- 2025CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddingscited by 1
- 2024Defection-Free Collaboration between Competitors in a Learning Systemcited by 0
- 2024Fast convergence of a Federated Expectation-Maximization Algorithmcited by 0
- 2024Your Data, My Model: Learning Who Really Helps in Federated Learningcited by 0
- 2026SP-CACW: Convergence-Aware Client Weighting for Selfish Personalized Learningcited by 0
- 2026SP-CACW: Convergence-Aware Client Weighting for Selfish Personalized Learning28 Jun 2026
- 2025Adaptive collaboration for online personalized distributed learning with heterogeneous clients9 Jul 2025
- 2025CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddings27 Jun 2025
- 2024Distributionally Robust Clustered Federated Learning: A Case Study in Healthcare9 Oct 2024
- 2024Collaborative and Efficient Personalization with Mixtures of Adaptors4 Oct 2024
- 2024Fine-Tuning Personalization in Federated Learning to Mitigate Adversarial Clients30 Sep 2024
- 2024CoBo: Collaborative Learning via Bilevel Optimization9 Sep 2024
- 2024Your Data, My Model: Learning Who Really Helps in Federated Learning3 Sep 2024
- 2024Fast convergence of a Federated Expectation-Maximization Algorithm11 Aug 2024
- 2024Defection-Free Collaboration between Competitors in a Learning System22 Jun 2024
- 2024Noise-Aware Algorithm for Heterogeneous Differentially Private Federated Learning5 Jun 2024