FedRich: Towards efficient federated learning for heterogeneous clients using heuristic scheduling

  • He Yang
  • , Wei Xi
  • , Zizhao Wang
  • , Yuhao Shen
  • , Xinyuan Ji
  • , Cerui Sun
  • , Jizhong Zhao

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

Federated Learning (FL) always involves a large number of heterogeneous clients (both in statistic and resource heterogeneity) when collaboratively training a model, leading to a compromise in the model performance. Recent research has focused on customizing FL frameworks to address the issues. However, compared to models trained on independent and identically distributed (IID) data, these methods still face performance degradation in non-IID scenarios. Moreover, resource consumption is also somewhat expensive. In this work, we present an efficient FL framework named FedRich to tackle the statistic and resource heterogeneity. The key idea of FedRich is adaptive segmentation of the model and heuristic scheduling of the active clients. Adaptive segmentation enables resource-dependent customization of the model, which is conducive to clients with varying resource budgets to conduct local training. The heuristic scheduling strategy appropriately selects clients to participate in federated training, mitigating statistical heterogeneity. Moreover, FedRich incorporates a hierarchical aggregation mechanism to stably aggregate heterogeneous models of different sophistication. Extensive experimental results on three benchmark datasets demonstrate that FedRich outperforms state-of-the-art heterogeneous FL approaches.

Original languageEnglish
Article number119360
JournalInformation Sciences
Volume645
DOIs
StatePublished - Oct 2023

Keywords

  • Federated learning
  • Internet of things
  • Resource heterogeneity
  • Statistic heterogeneity

Fingerprint

Dive into the research topics of 'FedRich: Towards efficient federated learning for heterogeneous clients using heuristic scheduling'. Together they form a unique fingerprint.

Cite this