FedSUM Family: Efficient Federated Learning Methods under Arbitrary Client Participation

Runze You, Shi Pu
12/20/2025
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

Federated Learning (FL) methods are often designed for specific client participation patterns, limiting their applicability in practical deployments. We introduce the FedSUM family of algorithms, which supports arbitrary client participation without additional assumptions on data heterogeneity. Our framework models participation variability with two delay metrics, the maximum delay $τ_{\max}$ and the average delay $τ_{\text{avg}}$. The FedSUM family comprises three variants: FedSUM-B (basic version), FedSUM (standard version), and FedSUM-CR (communication-reduced version). We provide unified convergence guarantees demonstrating the effectiveness of our approach across diverse participation patterns, thereby broadening the applicability of FL in real-world scenarios.

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{you2025fedsum,
  title  = {FedSUM Family: Efficient Federated Learning Methods under Arbitrary Client Participation},
  author = {Runze You and Shi Pu},
  year   = {2025},
  eprint = {2512.18275},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.18275v1}
}

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

Discussion