GPFL: A Gradient Projection-Based Client Selection Framework for Efficient Federated Learning

Shijie Na, Yuzhi Liang, Siu-Ming Yiu
3/26/2024
cs.LGcs.DC

No confident code implementation found for this paper.

Abstract

Federated learning client selection is crucial for determining participant clients while balancing model accuracy and communication efficiency. Existing methods have limitations in handling data heterogeneity, computational burdens, and independent client treatment. To address these challenges, we propose GPFL, which measures client value by comparing local and global descent directions. We also employ an Exploit-Explore mechanism to enhance performance. Experimental results on FEMINST and CIFAR-10 datasets demonstrate that GPFL outperforms baselines in Non-IID scenarios, achieving over 9\% improvement in FEMINST test accuracy. Moreover, GPFL exhibits shorter computation times through pre-selection and parameter reuse in federated learning.

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{na2024gpfl,
  title  = {GPFL: A Gradient Projection-Based Client Selection Framework for Efficient Federated Learning},
  author = {Shijie Na and Yuzhi Liang and Siu-Ming Yiu},
  year   = {2024},
  eprint = {2403.17833},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.17833v2}
}

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/2403.17833.svg)](https://codeofpaper.com/paper/2403.17833)

Discussion