BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training

Laurent Condat, Artavazd Maranjyan, Peter Richtárik
1/18/2026
math.OCcs.LG

No confident code implementation found for this paper.

Abstract

Slow and costly communication is often the main bottleneck in distributed optimization, especially in federated learning where it occurs over wireless networks. We introduce BiCoLoR, a communication-efficient optimization algorithm that combines two widely used and effective strategies: local training, which increases computation between communication rounds, and compression, which encodes high-dimensional vectors into short bitstreams. While these mechanisms have been combined before, compression has typically been applied only to uplink (client-to-server) communication, leaving the downlink (server-to-client) side unaddressed. In practice, however, both directions are costly. We propose BiCoLoR, the first algorithm to combine local training with bidirectional compression using arbitrary unbiased compressors. This joint design achieves accelerated complexity guarantees in both convex and strongly convex heterogeneous settings. Empirically, BiCoLoR outperforms existing algorithms and establishes a new standard in communication efficiency.

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{condat2026bicolor,
  title  = {BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training},
  author = {Laurent Condat and Artavazd Maranjyan and Peter Richtárik},
  year   = {2026},
  eprint = {2601.12400},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.12400v1}
}

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

Discussion