activity
20182021
most citedRobust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions

28 citations · 48 across the 3 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

math.OC2018★ 28 cited

Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions

Artin Spiridonoff, Alex Olshevsky, Ioannis Ch. Paschalidis

We consider the standard model of distributed optimization of a sum of functions $F(\bz) = \sum_{i=1}^n f_i(\bz)$, where node in a network holds the function $f_i(\bz)$. We all…

math.OC2018

Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

Alex Olshevsky, Ioannis Ch. Paschalidis, Artin Spiridonoff

We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average…