FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models

Kai Yi, Georg Meinhardt, Laurent Condat, Peter Richtárik
3/14/2024
cs.LGcs.AIcs.DC

No official code found. Best implementation: WilliamYi96/FedComLoc (1 star, Apache-2.0, last commit 2025-09-16).

Abstract

Federated Learning (FL) has garnered increasing attention due to its unique characteristic of allowing heterogeneous clients to process their private data locally and interact with a central server, while being respectful of privacy. A critical bottleneck in FL is the communication cost. A pivotal strategy to mitigate this burden is Local Training, which involves running multiple local stochastic gradient descent iterations between communication phases. Our work is inspired by the innovative Scaffnew algorithm, which has considerably advanced the reduction of communication complexity in FL. We introduce FedComLoc (Federated Compressed and Local Training), integrating practical and effective compression into Scaffnew to further enhance communication efficiency. Extensive experiments, using the popular TopK compressor and quantization, demonstrate its prowess in substantially reducing communication overheads in heterogeneous settings.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models. TMLR, 2025.

10Shell, PythonMar 14, 20241 years agoApache-2.0

Similar Papers

Cite this paper

@article{yi2024fedcomloc,
  title  = {FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models},
  author = {Kai Yi and Georg Meinhardt and Laurent Condat and Peter Richtárik},
  year   = {2024},
  eprint = {2403.09904},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.09904v2}
}

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

Discussion