Related Experiment Video
Updated: Dec 7, 2025

Deep Neural Networks for Image-Based Dietary Assessment
Published on: March 13, 2021
Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly
Artin Spiridonoff1, Alex Olshevsky1, Ioannis Ch Paschalidis1
1Division of Systems Engineering, Boston University, Boston, MA 02215, USA.
Abstract:
We consider the standard model of distributed optimization of a sum of functions , where node i in a network holds the function f (z). We allow for a harsh network model characterized by asynchronous updates, message delays, unpredictable message losses, and directed communication among nodes. In this setting, we analyze a modification of the Gradient-Push method for distributed optimization, assuming that (i) node i is capable of generating gradients of its function f (z) corrupted by zero-mean bounded-support additive noise at each step, (ii) F(z) is strongly convex, and (iii) each f (z) has Lipschitz gradients. We show that our proposed method asymptotically performs as well as the best bounds on centralized gradient descent that takes steps in the direction of the sum of the noisy gradients of all the functions f 1(z), …, f (z) at each step.
Related Concept Videos
Application of Nonlinear Inequalities
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gradient and Del Operator
Introduction to Nonlinear Inequalities
Propagation of Uncertainty from Random Error
Divergence and Stokes' Theorems