LoDAdaC: a unified local training-based decentralized framework with adaptive gradients and compressed communication
Not on the map. Why?
Abstract (arXiv)
In the decentralized distributed learning, achieving fast convergence and low communication cost is essential for scalability and high efficiency. Adaptive gradient methods, such as Adam, have demonstrated strong practical performance in deep learning and centralized distributed settings. However, their convergence properties remain largely unexplored in decentralized settings involving multiple local training steps, such as federated learning. To address this limitation, we propose LoDAdaC, a unified multiple Local Training (MLT) Decentralized framework with Adam-type updates and Compressed communication (CC). LoDAdaC accommodates a broad class of optimizers for its local adaptive updates, including AMSGrad, Adam, and AdaGrad; it is compatible with standard (possibly biased) compressors such as low-bit quantization and sparsification. MLT and CC enable LoDAdaC to achieve multiplied reduction of communication cost, while the technique of adaptive updates enables fast convergence. We rigorously prove the combined advantage through complexity analysis. In addition, experiments on image classification and GPT-style language model training validate our theoretical findings and show that LoDAdaC significantly outperforms existing decentralized algorithms in terms of convergence speed and communication efficiency.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 50 of its 65 references that are in the map. First posted on arXiv 11 Apr 2026.
Builds on
50 of 65 references.
References · 50
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2020Adaptive Federated Optimizationcited by 1,046
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
- 2019On the Convergence of Adam and Beyondcited by 841
- 2018Local SGD Converges Fast and Communicates Littlecited by 605
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
- 2018Sparsified SGD with Memorycited by 376
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
- 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 356
- 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 278
38 more
- 2017Sparse Communication for Distributed Gradient Descentcited by 249
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
- 2019Fixup Initialization: Residual Learning Without Normalizationcited by 198
- 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 181
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2018Training Deep Neural Networks with 8-bit Floating Point Numberscited by 164
- 2020Federated Learning with Compression: Unified Analysis and Sharp Guaranteescited by 160
- 2016Stochastic Variance Reduction for Nonconvex Optimizationcited by 145
- 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
- 2017Network Topology and Communication-Computation Tradeoffs in Decentralized Optimizationcited by 122
- 2021Decentralized Federated Averagingcited by 114
- 2019Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronizationcited by 107
- 2014Deep learning with Elastic Averaging SGDcited by 90
- 2019Peer-to-peer Federated Learning on Graphscited by 85
- 2022Communication-Efficient Adaptive Federated Learningcited by 55
- 2020Decentralized Federated Learning via SGD over Wireless D2D Networkscited by 33
- 2020SQuARM-SGD: Communication-Efficient Momentum SGD for Decentralized Optimizationcited by 31
- 2019DADAM: A Consensus-based Distributed Adaptive Gradient Method for Online Optimizationcited by 30
- 2020Quantized Adam with Error Feedbackcited by 27
- 2019Local AdaAlter: Communication-Efficient Stochastic Gradient Descent with Adaptive Learning Ratescited by 26
- 2021Toward Communication Efficient Adaptive Gradient Methodcited by 25
- 2019Communication-Efficient Local Decentralized SGD Methodscited by 23
- 2023Efficient Federated Learning via Local Adaptive Amended Optimizer with Linear Speedupcited by 23
- 2021Communication-efficient SGD: From Local SGD to One-Shot Averagingcited by 19
- 2022On Distributed Adaptive Optimization with Gradient Compressioncited by 19
- 2021On the Convergence of Decentralized Adaptive Gradient Methodscited by 17
- 2023On the Role of Server Momentum in Federated Learningcited by 16
- 2021Communication-Compressed Adaptive Gradient Method for Distributed Nonconvex Optimizationcited by 12
- 2022Efficient-Adam: Communication-Efficient Distributed Adamcited by 11
- 2023Compressed Decentralized Proximal Stochastic Gradient Method for Nonconvex Composite Problems with Heterogeneous Datacited by 11
- 2024LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compressioncited by 11
- 2024The Effectiveness of Local Updates for Decentralized Learning under Data Heterogeneitycited by 7
- 2023Communication-Efficient Design for Quantized Decentralized Federated Learningcited by 6
- 2021A Decentralized Primal-Dual Framework for Non-convex Smooth Consensus Optimizationcited by 5
- 2020Parallel and distributed asynchronous adaptive stochastic gradient methodscited by 4
- 2024From promise to practice: realizing high-performance decentralized trainingcited by 4
- 2025Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimizationcited by 2
- 2020Adaptive Serverless Learningcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025DeCAF: Decentralized Consensus-And-Factorization for Low-Rank Adaptation of Foundation Models
- 2021Peering Beyond the Gradient Veil with Distributed Auto Differentiation
- 2022Maximizing Communication Efficiency for Large-scale Training via 0/1 Adam
- 2021Low Precision Decentralized Distributed Training over IID and non-IID Data
- 2025NetSenseML: Network-Adaptive Compression for Efficient Distributed Machine Learning
- 2024Lion Cub: Minimizing Communication Overhead in Distributed Lion
- 2021Learned Gradient Compression for Distributed Deep Learning
- 2024FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models