Local Methods with Adaptivity via Scaling
Not on the map. Why?
Abstract (arXiv)
The rapid development of machine learning and deep learning has introduced increasingly complex optimization challenges that must be addressed. Indeed, training modern, advanced models has become difficult to implement without leveraging multiple computing nodes in a distributed environment. Distributed optimization is also fundamental to emerging fields such as federated learning. Specifically, there is a need to organize the training process to minimize the time lost due to communication. A widely used and extensively researched technique to mitigate the communication bottleneck involves performing local training before communication. This approach is the focus of our paper. Concurrently, adaptive methods that incorporate scaling, notably led by Adam, have gained significant popularity in recent years. Therefore, this paper aims to merge the local training technique with the adaptive approach to develop efficient distributed learning methods. We consider the classical Local SGD method and enhance it with a scaling feature. A crucial aspect is that the scaling is described generically, allowing us to analyze various approaches, including Adam, RMSProp, and OASIS, in a unified manner. In addition to theoretical analysis, we validate the performance of our methods in practice by training a neural network.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 34 of its 51 references that are in the map. First posted on arXiv 2 Jun 2024.
Builds on
34 of 51 references.
References · 34
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2020Adaptive Federated Optimizationcited by 1,036
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
- 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 349
- 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 280
- 2019Tighter Theory for Local SGD on Identical and Heterogeneous Datacited by 266
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
22 more
- 2019A Survey on Distributed Machine Learningcited by 187
- 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
- 2020A Simple Convergence Proof of Adam and Adagradcited by 169
- 2020On Biased Compression for Distributed Learningcited by 140
- 2022ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!cited by 134
- 2013Communication Efficient Distributed Optimization using an Approximate Newton-type Methodcited by 131
- 2019SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentumcited by 121
- 2019Distributed Learning with Compressed Gradient Differencescited by 110
- 2018SGD and Hogwild! Convergence Without the Bounded Gradients Assumptioncited by 94
- 2019Variance Reduced Local SGD with Lower Communication Complexitycited by 80
- 2016CoCoA: A General Framework for Communication-Efficient Distributed Optimizationcited by 69
- 2015Communication Complexity of Distributed Convex Learning and Optimizationcited by 59
- 2021Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspectivecited by 38
- 2020Statistically Preconditioned Accelerated Gradient Method for Distributed Optimizationcited by 29
- 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalitiescited by 25
- 2021Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Informationcited by 16
- 2019Distributed Fixed Point Methods with Compressed Iteratescited by 11
- 2022Optimal Gradient Sliding and its Application to Distributed Optimization Under Similaritycited by 9
- 2019Parallel Restarted SPIDER -- Communication Efficient Distributed Nonconvex Optimization with Optimal Computation Complexitycited by 8
- 2021Distributed Saddle-Point Problems Under Similaritycited by 8
- 2022Stochastic Gradient Methods with Preconditioned Updatescited by 5
- 2022On Scaled Methods for Saddle Point Problemscited by 3
Built on by
Citing papers per year: 2024: 1.
1 paper.