Federated Two Stage Decoupling With Adaptive Personalization Layers
Not on the map. Why?
Abstract (arXiv)
Federated learning has gained significant attention due to its groundbreaking ability to enable distributed learning while maintaining privacy constraints. However, as a consequence of data heterogeneity among decentralized devices, it inherently experiences significant learning degradation and slow convergence speed. Therefore, it is natural to employ the concept of clustering homogeneous clients into the same group, allowing only the model weights within each group to be aggregated. While most existing clustered federated learning methods employ either model gradients or inference outputs as metrics for client partitioning, with the goal of grouping similar devices together, may still have heterogeneity within each cluster. Moreover, there is a scarcity of research exploring the underlying reasons for determining the appropriate timing for clustering, resulting in the common practice of assigning each client to its own individual cluster, particularly in the context of highly non independent and identically distributed (Non-IID) data. In this paper, we introduce a two-stage decoupling federated learning algorithm with adaptive personalization layers named FedTSDP, where client clustering is performed twice according to inference outputs and model weights, respectively. Hopkins amended sampling is adopted to determine the appropriate timing for clustering and the sampling weight of public unlabeled data. In addition, a simple yet effective approach is developed to adaptively adjust the personalization layers based on varying degrees of data skew. Experimental results show that our proposed method has reliable performance on both IID and non-IID scenarios.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 23 of its 51 references that are in the map. First posted on arXiv 30 Aug 2023.
Builds on
23 of 51 references.
References · 23
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,653
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,991
- 2018Federated Optimization in Heterogeneous Networkscited by 2,981
- 2018Federated Learning with Non-IID Datacited by 1,106
- 2017Federated Multi-Task Learningcited by 670
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 668
- 2021FedBN: Federated Learning on Non-IID Features via Local Batch Normalizationcited by 570
- 2021Federated Learning on Non-IID Data Silos: An Experimental Studycited by 568
- 2019Federated Learning with Personalization Layerscited by 539
- 2021Exploiting Shared Representations for Personalized Federated Learningcited by 539
- 2020An Efficient Framework for Clustered Federated Learningcited by 508
- 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 502
11 more
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 419
- 2021Federated Learning on Non-IID Data: A Surveycited by 346
- 2020Think Locally, Act Globally: Federated Learning with Local and Global Representationscited by 324
- 2021No Fear of Heterogeneity: Classifier Calibration for Federated Learning with Non-IID Datacited by 241
- 2020Federated learning with hierarchical clustering of local updates to improve training on non-IID datacited by 223
- 2022Federated Learning with Partial Model Personalizationcited by 114
- 2021Multi-Center Federated Learning: Clients Clustering for Better Personalizationcited by 113
- 2021Flexible Clustered Federated Learning for Client-Level Data Distribution Shiftcited by 47
- 2021FedSoft: Soft Clustered Federated Learning with Proximal Local Updatingcited by 46
- 2020Communication-Efficient Federated Learning with Compensated Overlap-FedAvgcited by 31
- 2022FLIS: Clustered Federated Learning via Inference Similarity for Non-IID Data Distributioncited by 22
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.