FedDAG: Clustered Federated Learning via Global Data and Gradient Integration for Heterogeneous Environments
Anik Pramanik, Murat Kantarcioglu, Vincent Oria, Shantanu Sharma
Abstract
Federated Learning (FL) enables a group of clients to collaboratively train a model without sharing individual data, but its performance drops when client data are heterogeneous. Clustered FL tackles this by grouping similar clients. However, existing clustered FL approaches rely solely on either data similarity or gradient similarity; however, this results in an incomplete assessment of client similarities. Prior clustered FL approaches also restrict knowledge and representation sharing to clients within the same cluster. This prevents cluster models from benefiting from the diverse client population across clusters. To address these limitations, FEDDAG introduces a clustered FL framework, FEDDAG, that employs a weighted, class-wise similarity metric that integrates both data and gradient information, providing a more holistic measure of similarity during clustering. In addition, FEDDAG adopts a dual-encoder architecture for cluster models, comprising a primary encoder trained on its own clients' data and a secondary encoder refined using gradients from complementary clusters. This enables cross-cluster feature transfer while preserving cluster-specific specialization. Experiments on diverse benchmarks and data heterogeneity settings show that FEDDAG consistently outperforms state-of-the-art clustered FL baselines in accuracy. INTRODUCTION Federated Learning (FL) enables users/clients to collaboratively train a model on their data without sharing it with other clients or a central entity (McMahan et al., 2017) . However, diversity in user behavior results in heterogeneous data distributions, known as non-identically independently distributed (non-IID) data, across clients. This heterogeneity can lead to slower convergence and suboptimal accuracy of the global model (Kairouz et al., 2021) . More specifically, non-IID data can arise due to various factors, including class/label skew, feature skew, quantity shift, concept shift, and concept drift -common types of data heterogeneity. Class/label skew refers to the nonidentical distribution of labels/classes at different clients, e.g., the absence of a label at one client while the same label is present at other clients (Zhang et al., 2022a). Feature skew occurs when distributions vary due to different personalization nuances, e.g., an alphabet letter can be written in different ways (Li et al., 2021b). Quantity shift happens when different clients have different amounts of data (Wang et al., 2021) , e.g., an online retailer with millions of transaction records is compared to a local store with only a few hundred records. Concept shift happens when different clients assign the same label to fundamentally different data samples due to variations in local data distributions or labeling criteria (Kang et al., 2024) . Clustered FL handles non-IID data effectively, especially when distinct groups of clients display substantial variations in their data distributions (Ghosh et al., 2020; Guo et al., 2024; Vahidian et al., 2023) . In clustered FL, clients are grouped into clusters based on their similarities in their data distributions, and each cluster trains its own model tailored to its specific data. However, despite their advantages, existing clustered FL approaches suffer from the following limitations: 1. Improper Similarity Method. Cluster FL approaches use either data or gradient alone to compute similarity for clustering. Cluster FL approaches (Sattler et al., 2020; Long et al., 2023; Ghosh et al., 2020) that use gradients or loss values to cluster clients can group clients incorrectly due to the
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b938f3e5-b629-47fd-a34a-93466c1911d6Builds on29
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone et al.CCS 2017 · 3,936 citations
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi et al.ICML 2020 · 3,875 citations
- Ensemble Distillation for Robust Model Fusion in Federated LearningTao Lin, Lingjing Kong, Sebastian U. Stich, Martin JaggiNeurIPS 2020 · 1,615 citations
- Personalized Federated Learning with Moreau EnvelopesCanh T. Dinh, Nguyen Hoang Tran, Tuan Dung NguyenNeurIPS 2020 · 1,542 citations
- Personalized Federated Learning with Theoretical Guarantees: A Model-Agnostic Meta-Learning ApproachAlireza Fallah, Aryan Mokhtari, Asuman E. OzdaglarNeurIPS 2020 · 1,354 citations
Related papers
- Interaction-Aware Gaussian Weighting for Clustered Federated LearningAlessandro Licciardi, Davide Leo, Eros Fanì, Barbara Caputo et al.ICML 2025
- Efficient Distribution Similarity Identification in Clustered Federated Learning via Principal Angles between Client Data SubspacesSaeed Vahidian, Mahdi Morafah, Weijia Wang, Vyacheslav Kungurtsev et al.AAAI 2023 · 97 citations
- Structured Federated Learning through Clustered Additive ModelingJie Ma, Tianyi Zhou, Guodong Long, Jing Jiang et al.NeurIPS 2023 · 28 citations
- FedCE: Personalized Federated Learning Method based on Clustering EnsemblesLuxin Cai, Naiyue Chen, Yuanzhouhan Cao, Jiahuan He et al.ACM MM 2023 · 27 citations
- Intra-Class Unbiased Prototype Aggregation and Classifier Collaboration for Personalized Federated LearningHao Zheng, Shiyu Song, Zhigang Hu, Meiguang Zheng et al.AAAI 2026
