Clustered Federated Learning (CFL) has attracted extensive attention due to its ability to cluster clients into different clusters based on data distribution, thereby mitigating the impact of the inherent Non-IID characteristics of client data. Existing CFL methods often involve slow convergence and inflexible clustering strategies. To address these issues, this paper proposes FedPSAC, an innovative CFL algorithm that effectively identifies similarities between data distributions by analyzing the prototypes of client data and adaptively discovers the clustering structure of clients without the need to predefine the number of clusters through the Affinity Propagation algorithm. The server receives the prototypes extracted from local clients and uses a pre-trained neural network model to train the prototypes to enhance their representational capabilities. The server performs adaptive clustering by calculating the similarity of client prototypes and then aggregates models within each cluster. Additionally, a unique inter-cluster model optimization strategy is designed to enhance the convergence and generalization capabilities of cluster models. Extensive experiments on three datasets under three Non-IID settings demonstrate that FedPSAC outperforms several popular FL baseline methods in terms of average test accuracy in data heterogeneous scenarios.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Prototype Similarity-Based Adaptive Clustered Federated Learning Framework

  • Yincan Shu,
  • Xiaoli Zhao,
  • Hao Pan,
  • Xiaogang Lin,
  • Kangwei Wang

摘要

Clustered Federated Learning (CFL) has attracted extensive attention due to its ability to cluster clients into different clusters based on data distribution, thereby mitigating the impact of the inherent Non-IID characteristics of client data. Existing CFL methods often involve slow convergence and inflexible clustering strategies. To address these issues, this paper proposes FedPSAC, an innovative CFL algorithm that effectively identifies similarities between data distributions by analyzing the prototypes of client data and adaptively discovers the clustering structure of clients without the need to predefine the number of clusters through the Affinity Propagation algorithm. The server receives the prototypes extracted from local clients and uses a pre-trained neural network model to train the prototypes to enhance their representational capabilities. The server performs adaptive clustering by calculating the similarity of client prototypes and then aggregates models within each cluster. Additionally, a unique inter-cluster model optimization strategy is designed to enhance the convergence and generalization capabilities of cluster models. Extensive experiments on three datasets under three Non-IID settings demonstrate that FedPSAC outperforms several popular FL baseline methods in terms of average test accuracy in data heterogeneous scenarios.