CoChat

Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms

Open access
Tsitsiklis, John N., Bertsekas, Dimitri P., Athans, Michael · 1984 · 1984 American Control Conference
Cited by 77

The DOI matches its Crossref record.

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.23919/acc.1984.4788427

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 77

Metadata

Authors
Tsitsiklis, J. N., Bertsekas, D. P., & Athans, M.
Venue
1984 American Control Conference
Publisher
IEEE
Published
1984-07
Pages
484-489
ISSN
0743-1619 (ISSN-L)
OpenAlex
W1528719522
Cited by
77
References
0
FWCI
0.00
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms. https://app.cochat.ai/papers/10.23919/acc.1984.4788427
The paper
Tsitsiklis, J. N., Bertsekas, D. P., & Athans, M. (1984). Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms. 1984 American Control Conference. https://doi.org/10.23919/acc.1984.4788427

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.