Ranking-based Client Selection with Imitation Learning for Efficient Federated Learning

Chunlin Tian, Zhan Shi, Xinpeng Qin, Li Li, Chengzhong Xu
5/7/2024
cs.LGcs.DC

No confident code implementation found for this paper.

Abstract

Federated Learning (FL) enables multiple devices to collaboratively train a shared model while ensuring data privacy. The selection of participating devices in each training round critically affects both the model performance and training efficiency, especially given the vast heterogeneity in training capabilities and data distribution across devices. To address these challenges, we introduce a novel device selection solution called FedRank, which is an end-to-end, ranking-based approach that is pre-trained by imitation learning against state-of-the-art analytical approaches. It not only considers data and system heterogeneity at runtime but also adaptively and efficiently chooses the most suitable clients for model training. Specifically, FedRank views client selection in FL as a ranking problem and employs a pairwise training strategy for the smart selection process. Additionally, an imitation learning-based approach is designed to counteract the cold-start issues often seen in state-of-the-art learning-based approaches. Experimental results reveal that \model~ boosts model accuracy by 5.2\% to 56.9\%, accelerates the training convergence up to $2.01 \times$ and saves the energy consumption up to $40.1\%$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tian2024rankingbased,
  title  = {Ranking-based Client Selection with Imitation Learning for Efficient Federated Learning},
  author = {Chunlin Tian and Zhan Shi and Xinpeng Qin and Li Li and Chengzhong Xu},
  year   = {2024},
  eprint = {2405.04122},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.04122v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.04122.svg)](https://codeofpaper.com/paper/2405.04122)

Discussion