Communication-Efficient Distributed Asynchronous ADMM

Sagar Shrestha
8/17/2025
cs.LGeess.SP

No confident code implementation found for this paper.

Abstract

In distributed optimization and federated learning, asynchronous alternating direction method of multipliers (ADMM) serves as an attractive option for large-scale optimization, data privacy, straggler nodes and variety of objective functions. However, communication costs can become a major bottleneck when the nodes have limited communication budgets or when the data to be communicated is prohibitively large. In this work, we propose introducing coarse quantization to the data to be exchanged in aynchronous ADMM so as to reduce communication overhead for large-scale federated learning and distributed optimization applications. We experimentally verify the convergence of the proposed method for several distributed learning tasks, including neural networks.

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{shrestha2025communicationefficient,
  title  = {Communication-Efficient Distributed Asynchronous ADMM},
  author = {Sagar Shrestha},
  year   = {2025},
  eprint = {2508.12233},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.12233v1}
}

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

Discussion