Federated learning (FL) models face challenges such as negative transfer in non-IID scenarios, where the global model performs worse than local models. Clustered Federated Learning (CFL) addresses this by grouping clients based on pairwise similarity, but the high computational cost limits the scalability. To solve this, we propose FedBCE, an efficient CFL framework that significantly reduces clustering time by calculating distances only to selected centers while grouping clients using data volume and model similarity to enable collaboration among those with similar data distributions. Experiments on public data sets show that FedBCE reduces the clustering time to just \(\frac{1}{10}\)  to \(\frac{1}{160}\) of existing methods while increasing the accuracy by 19% on average in non-IID scenarios.

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

FedBCE: Rethinking Clustered Federated Learning for Better Clustering Efficiency

  • Huaibin Ye,
  • Zuobin Ying,
  • Jiechao Gao,
  • Ximeng Liu,
  • Jianping Cai

摘要

Federated learning (FL) models face challenges such as negative transfer in non-IID scenarios, where the global model performs worse than local models. Clustered Federated Learning (CFL) addresses this by grouping clients based on pairwise similarity, but the high computational cost limits the scalability. To solve this, we propose FedBCE, an efficient CFL framework that significantly reduces clustering time by calculating distances only to selected centers while grouping clients using data volume and model similarity to enable collaboration among those with similar data distributions. Experiments on public data sets show that FedBCE reduces the clustering time to just \(\frac{1}{10}\)  to \(\frac{1}{160}\) of existing methods while increasing the accuracy by 19% on average in non-IID scenarios.