Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms
Year: 1984
Type: conference-paper
Abstract: We present a model for asynchronous distributed computation and then proceed to analyze the convergence of natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms. We show that such algorithms retain the desirable convergence properties of their centralized counterparts, provided that the time between consecutive communications between processors plus communication delays are not too large.
Institutions: Stanford University, Massachusetts Institute of Technology
Language: English
Subfield: Control and Systems Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1528719522
