Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions
From MaRDI portal
Publication:4969107
zbMath1499.90140arXiv1811.03982MaRDI QIDQ4969107
Artin Spiridonoff, Ioannis Ch. Paschalidis, Alex Olshevsky
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1811.03982
Programming involving graphs or networks (90C35) Convex programming (90C25) Communication networks in operations research (90B18) Stochastic programming (90C15)
Related Items (2)
A stochastic averaging gradient algorithm with multi‐step communication for distributed optimization ⋮ Distributed stochastic gradient tracking methods
Uses Software
Cites Work
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Distributed stochastic subgradient projection algorithms for convex optimization
- Non-Bayesian learning in the presence of Byzantine agents
- Reaching approximate Byzantine consensus with multi-hop communication
- Communication-efficient algorithms for decentralized and stochastic optimization
- On the Learning Behavior of Adaptive Networks—Part II: Performance Analysis
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Robust Distributed Average Consensus via Exchange of Running Sums
- Distributed Optimization Over Time-Varying Directed Graphs
- Robust Stochastic Approximation Approach to Stochastic Programming
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
- Optimization and Analysis of Distributed Averaging With Short Node Memory
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Linear Time Average Consensus and Distributed Optimization on Fixed Graphs
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance
- Success and Failure of Adaptation-Diffusion Algorithms With Decaying Step Size in Multiagent Networks
- A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach
- Harnessing Smoothness to Accelerate Distributed Optimization
- Decentralized Consensus Algorithm with Delayed and Stochastic Gradients
- A Flocking-Based Approach for Distributed Stochastic Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
- Fault-Tolerant Multi-Agent Optimization
- ADD-OPT: Accelerated Distributed Directed Optimization
This page was built for publication: Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions
