The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Accelerated Distributed Nesterov Gradient Descent
Open accessAbstract
This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an accelerated distributed Nesterov gradient descent method. When the objective function is convex and Lsmooth, we show that it achieves a O( 1/t1 .4 -ϵ) convergence rate for all ϵ ∈ (0, 1.4). We also show the convergence rate can be improved to O(1/t2) if the objective function is a composition of a linear map and a strongly convex and smooth function. When the objective function is μ-strongly convex and L-smooth, we show that it achieves a linear convergence rate of O([1 - C(μ/L )5/7]t), whereLμ is the condition number of the objective, and C > 0 is some constant that does not depend on L/μ .
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.
Integrity signals
Registry
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.
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
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“How to select a consensus matrix to satisfy these properties has been intensely studied, e.g. [25, 27].”
BackgroundErdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 2×
“Algorihtms to compare: We will compare our algorithm (Acc-DNGD-SC or Acc-DNGD-NSC) with the “D-NG” method in [37], Distributed Gradient Descent (DGD) in [11] with a vanishing step size, the “EXTRA” algorithm in [23] (with W̃ = W+I 2 ), the algorithm studied in [24]–[29], [32] (we name it “Acc-DGD”).”
MethodEXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261 · cited 3×
“The weight matrix W is chosen using the Laplacian method [31].”
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069 · cited 3×
“Instead, we use a gradient estimation sequence recently proposed in [24], [27], and [28], which is a more efficient use of consensus steps to get the correct descent direction.”
BackgroundMethodOn the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814 · cited 1×
“There exist many studies on developing distributed algorithms for this problem, e.g., [32, 4, 22, 15, 8, 30, 19, 20, 17, 26, 38, 16], most of which are distributed gradient descent algorithms based on a consensus scheme [24].”
BackgroundOn Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Cited by
Activated Gradients for Deep Neural Networks
Liu, M., Chen, L., Du, X., Jin, L., & Shang, M. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3106044 · Cited by 304
Communication-efficient distributed learning: An overview
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242710 · Cited by 139
“gradient descent algorithm was developed in [32].”
Metadata
- Authors
- Qu, G., & Li, N.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2020-06
- Volume
- 65
- Issue
- 6
- Pages
- 2566-2581
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2617089797
- Cited by
- 187
- References
- 17
- FWCI
- 9.23
- Type
- journal article
- 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: Accelerated Distributed Nesterov Gradient Descent. https://app.cochat.ai/papers/10.1109/tac.2019.2937496
- The paper
- Qu, G., & Li, N. (2020). Accelerated Distributed Nesterov Gradient Descent. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2019.2937496
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.