BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 54 of its 64 references that are in the map. First posted on arXiv 18 Jan 2026.
Builds on
54 of 64 references.
References · 54
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
- 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 349
- 2021A Field Guide to Federated Optimizationcited by 312
- 2019Tighter Theory for Local SGD on Identical and Heterogeneous Datacited by 266
- 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
38 more
- 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
- 2020Federated Learning with Compression: Unified Analysis and Sharp Guaranteescited by 159
- 2019On the Convergence of Local Descent Methods in Federated Learningcited by 150
- 2020Minibatch vs Local SGD for Heterogeneous Distributed Learningcited by 147
- 2020On Biased Compression for Distributed Learningcited by 140
- 2022ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!cited by 134
- 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 131
- 2021Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradientscited by 122
- 2019Distributed Learning with Compressed Gradient Differencescited by 110
- 2023Stochastic Controlled Averaging for Federated Learning with Communication Compressioncited by 100
- 2020Acceleration for Compressed Gradient Descent in Distributed and Federated Optimizationcited by 90
- 2019Natural Compression for Distributed Deep Learningcited by 88
- 2020Local SGD: Unified Theory and New Efficient Methodscited by 88
- 2019A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descentcited by 84
- 2020Variance-Reduced Methods for Machine Learningcited by 79
- 2020From Local SGD to Local Fixed-Point Methods for Federated Learningcited by 74
- 2019Stochastic Distributed Learning with Gradient Quantization and Variance Reductioncited by 64
- 2020Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressorcited by 45
- 2020Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guaranteescited by 45
- 2021Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspectivecited by 38
- 2020Optimal Gradient Compression for Distributed and Federated Learningcited by 37
- 2022Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compressioncited by 33
- 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learningcited by 33
- 2019A Double Residual Compression Algorithm for Efficient Distributed Learningcited by 31
- 2022EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compressioncited by 28
- 2022RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updatescited by 27
- 2021Preserved central model for faster bidirectional compression in distributed settingscited by 21
- 2022Federated Optimization Algorithms with Random Reshuffling and Gradient Compressioncited by 18
- 2022EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimizationcited by 17
- 2022GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexitycited by 17
- 2023Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?cited by 14
- 2021MURANA: A Generic Framework for Stochastic Variance-Reduced Optimizationcited by 13
- 2022Federated Random Reshuffling with Compression and Variance Reductioncited by 11
- 2022CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimizationcited by 11
- 2023Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compressioncited by 11
- 2024LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compressioncited by 11
- 2019One Method to Rule Them All: Variance Reduction for Data, Parameters and Many New Methodscited by 8
- 20232Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compressioncited by 5
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.