LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
Laurent Condat, Arto Maranjyan, Peter Richtárik
Abstract
In Distributed optimization and Learning, and even more in the modern framework of federated learning, communication, which is slow and costly, is critical. We introduce LoCoDL, a communication-efficient algorithm that leverages the two popular and effective techniques of Local training, which reduces the communication frequency, and Compression, in which short bitstreams are sent instead of full-dimensional vectors of floats. LoCoDL works with a large class of unbiased compressors that includes widely-used sparsification and quantization methods. LoCoDL provably benefits from local training and compression and enjoys a doubly-accelerated communication complexity, with respect to the condition number of the functions and the model dimension, in the general heterogenous regime with strongly convex functions. This is confirmed in practice, with LoCoDL outperforming existing algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c4b82b35-1b6c-41ad-b6f5-5899ef5c1b3dCited by top-tier papers3
- Achieving Lossless Gradient Sparsification via Mapping to Alternative Space in Federated LearningDo-Yeon Kim, Dong-Jun Han, Jun Seo, Jaekyun MoonICML 2024 · 4 citations
- Subspace Optimization for Large Language Models with Convergence GuaranteesYutong He, Pengrui Li, Yipeng Hu, Chuyan Chen et al.ICML 2025
- FedSMU: Communication-Efficient and Generalization-Enhanced Federated Learning through Symbolic Model UpdatesXinyi Lu, Hao Zhang, Chenglin Li, Weijia Lu et al.ICML 2025
Builds on19
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone et al.CCS 2017 · 3,936 citations
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi et al.ICML 2020 · 3,875 citations
- Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated LearningHaibo Yang, Minghong Fang, Jia LiuICLR 2021 · 310 citations
- EF21: A New, Simpler, Theoretically Better, and Practically Faster Error FeedbackPeter Richtárik, Igor Sokolov, Ilyas FatkhullinNeurIPS 2021 · 219 citations
- ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!Konstantin Mishchenko, Grigory Malinovsky, Sebastian U. Stich, Peter RichtárikICML 2022 · 200 citations
Related papers
- On the Convergence of Communication-Efficient Local SGD for Federated LearningHongchang Gao, An Xu, Heng HuangAAAI 2021 · 66 citations
- Accelerated Methods with Compressed Communications for Distributed Optimization Problems Under Data SimilarityDmitry Bylinkin, Aleksandr BeznosikovAAAI 2025 · 3 citations
- Unlocking the Potential of Weighting Methods in Federated Learning Through Communication CompressionValerii Parfenov, Nail Bashirov, Daniil Medyakov, Dmitry Bylinkin et al.ICLR 2026
- LCO-AGQ: A Lightweight Client-Oriented Adaptive Gradient Quantization Algorithm for Federated LearningHengrui Cui, Zhihao Qu, Xinyu Wang, Bin Tang et al.INFOCOM 2025 · 3 citations
- Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse GradientsAritra Mitra, Rayana H. Jaafar, George J. Pappas, Hamed HassaniNeurIPS 2021 · 193 citations
