Accelerating Optimization and Machine Learning through Decentralization
Not on the map. Why?
Abstract (arXiv)
Decentralized optimization enables multiple devices to learn a global machine learning model while each individual device only has access to its local dataset. By avoiding the need for training data to leave individual users' devices, it enhances privacy and scalability compared to conventional centralized learning, where all data has to be aggregated to a central server. However, decentralized optimization has traditionally been viewed as a necessary compromise, used only when centralized processing is impractical due to communication constraints or data privacy concerns. In this study, we show that decentralization can paradoxically accelerate convergence, outperforming centralized methods in the number of iterations needed to reach optimal solutions. Through examples in logistic regression and neural network training, we demonstrate that distributing data and computation across multiple agents can lead to faster learning than centralized approaches, even when each iteration is assumed to take the same amount of time, whether performed centrally on the full dataset or decentrally on local subsets. This finding challenges longstanding assumptions and reveals decentralization as a strategic advantage, offering new opportunities for more efficient optimization and machine learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 51 references that are in the map. First posted on arXiv 21 Apr 2026.
Builds on
23 of 51 references.
References · 23
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2020Adaptive Federated Optimizationcited by 1,046
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 305
- 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 180
- 2014EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimizationcited by 160
- 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
- 2016Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphscited by 150
- 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 111
11 more
- 2017Collaborative Deep Learning in Fixed Topology Networkscited by 60
- 2018Push-Pull Gradient Methods for Distributed Optimization in Networkscited by 46
- 2015Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methodscited by 37
- 2022JuMP 1.0: Recent improvements to a modeling language for mathematical optimizationcited by 37
- 2021Climate-Invariant Machine Learningcited by 24
- 2024The Privacy Power of Correlated Noise in Decentralized Learningcited by 18
- 2015Exact Worst-case Performance of First-order Methods for Composite Convex Optimizationcited by 16
- 2024Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailabilitycited by 9
- 2022Decentralized Gradient Methods with Time-varying Uncoordinated Stepsizes: Convergence Analysis and Privacy Designcited by 6
- 2022Automatic Performance Estimation for Decentralized Optimizationcited by 3
- 2025Several Performance Bounds on Decentralized Online Optimization are Highly Conservative and Potentially Misleadingcited by 2
Built on by
Not cited yet.