On the Influence of Bias-Correction on Distributed Stochastic Optimization
arXiv:1903.10956 · doi:10.1109/TSP.2020.3008605
Abstract
Various bias-correction methods such as EXTRA, gradient tracking methods, and exact diffusion have been proposed recently to solve distributed {\em deterministic} optimization problems. These methods employ constant step-sizes and converge linearly to the {\em exact} solution under proper conditions. However, their performance under stochastic and adaptive settings is less explored. It is still unknown {\em whether}, {\em when} and {\em why} these bias-correction methods can outperform their traditional counterparts (such as consensus and diffusion) with noisy gradient and constant step-sizes. This work studies the performance of exact diffusion under the stochastic and adaptive setting, and provides conditions under which exact diffusion has superior steady-state mean-square deviation (MSD) performance than traditional algorithms without bias-correction. In particular, it is proven that this superiority is more evident over sparsely-connected network topologies such as lines, cycles, or grids. Conditions are also provided under which exact diffusion method match or may even degrade the performance of traditional methods. Simulations are provided to validate the theoretical findings.
17 pages, 9 figure, submitted for publication
References in corpus (6)
- SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
- Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication
- DSA: Decentralized Double Stochastic Averaging Gradient Algorithm
- On the Influence of Bias-Correction on Distributed Stochastic Optimization
- Stability and Performance Limits of Adaptive Primal-Dual Networks
- Variance-Reduced Decentralized Stochastic Optimization with Gradient Tracking--Part I: GT-SAGA
Cited by in corpus (18)
- Variance-Reduced Decentralized Stochastic Optimization with Accelerated Convergence
- An improved convergence analysis for decentralized online stochastic non-convex optimization
- On the Influence of Bias-Correction on Distributed Stochastic Optimization
- A Unified and Refined Convergence Analysis for Non-Convex Decentralized Learning
- Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data
- Can Primal Methods Outperform Primal-dual Methods in Decentralized Dynamic Optimization?
- Networked Signal and Information Processing
- An introduction to decentralized stochastic optimization with gradient tracking
- Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD
- Fast decentralized non-convex finite-sum optimization with recursive variance reduction
- A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization
- A Stochastic Proximal Gradient Framework for Decentralized Non-Convex Composite Optimization: Topology-Independent Sample Complexity and Communication Efficiency
- Refined Convergence and Topology Learning for Decentralized SGD with Heterogeneous Data
- Improving the Transient Times for Distributed Stochastic Gradient Methods
- A fast randomized incremental gradient method for decentralized non-convex optimization
- Accelerating Gossip SGD with Periodic Global Averaging
- A general framework for decentralized optimization with first-order methods
- Distributed Sparse Regression via Penalization