An Adaptive Clustering Scheme for Client Selections in Communication-Efficient Federated Learning

Yan-Ann Chen, Guan-Lin Chen
4/11/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Federated learning is a novel decentralized learning architecture. During the training process, the client and server must continuously upload and receive model parameters, which consumes a lot of network transmission resources. Some methods use clustering to find more representative customers, select only a part of them for training, and at the same time ensure the accuracy of training. However, in federated learning, it is not trivial to know what the number of clusters can bring the best training result. Therefore, we propose to dynamically adjust the number of clusters to find the most ideal grouping results. It may reduce the number of users participating in the training to achieve the effect of reducing communication costs without affecting the model performance. We verify its experimental results on the non-IID handwritten digit recognition dataset and reduce the cost of communication and transmission by almost 50% compared with traditional federated learning without affecting the accuracy of the model.

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{chen2025adaptive,
  title  = {An Adaptive Clustering Scheme for Client Selections in Communication-Efficient Federated Learning},
  author = {Yan-Ann Chen and Guan-Lin Chen},
  year   = {2025},
  eprint = {2504.08356},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.08356v1}
}

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

Discussion