CoChat

Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms

Su, Lili, Vaidya, Nitin H. · 2016 · Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Cited by 125

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

This paper addresses the problem of distributed multi-agent optimization in which each agent i has a local cost function hi(x), and the goal is to optimize a global cost function that aggregates the local cost functions. Such optimization problems are of interest in many contexts, including distributed machine learning, distributed resource allocation, and distributed robotics.

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.1145/2933057.2933105

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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

Cites

Research works printed but not linked: 29

  1. 10.1007/11516798_17 · doi:10.1007/11516798_17
  2. D. P. Bertsekas . Convex Optimization Algorithms . Athena Scientific , 2015 . D. P. Bertsekas. Convex Optimization Algorithms. Athena Scientific, 2015.
  3. S. Boyd and L. Vandenberghe . Convex optimization . Cambridge university press , 2004 . S. Boyd and L. Vandenberghe. Convex optimization. Cambridge university press, 2004. · DOI · Paper page
  4. 10.1006/inco.1993.1043 · doi:10.1006/inco.1993.1043
  5. 10.1109/TSP.2012.2198470 · DOI · Paper page
  6. 10.1145/5925.5931 · DOI · Paper page
  7. 10.1145/5925.5931 · DOI · Paper page
  8. J. Duchi , A. Agarwal , and M. Wainwright . Dual averaging for distributed optimization: Convergence analysis and network scaling. Automatic Control , IEEE Transactions on , 57 ( 3 ): 592 -- 606 , March 2012 . J. Duchi, A. Agarwal, and M. Wainwright. Dual averaging for distributed optimization: Convergence analysis and network scaling. Automatic Control, IEEE Transactions on, 57(3):592--606, March 2012.
  9. 10.1007/BF01783662 · DOI
  10. 10.1109/TC.2007.1043 · DOI
  11. M. Herlihy , S. Rajsbaum , M. Raynal , and J. Stainer . Computing in the presence of concurrent solo executions . In LATIN 2014: Theoretical Informatics , pages 214 -- 225 . Springer Berlin Heidelberg , 2014 . M. Herlihy, S. Rajsbaum, M. Raynal, and J. Stainer. Computing in the presence of concurrent solo executions. In LATIN 2014: Theoretical Informatics, pages 214--225. Springer Berlin Heidelberg, 2014. · DOI
  12. B. Johansson . On distributed optimization in networked systems . 2008 . B. Johansson. On distributed optimization in networked systems. 2008.
  13. 10.1145/2185505.2185507 · DOI
  14. N. A. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
  15. 10.1145/2488608.2488657 · DOI
  16. 10.1145/950620.950624 · doi:10.1145/950620.950624
  17. 10.5555/2670022 · doi:10.5555/2670022
  18. 10.1007/978-1-4612-5110-1_10 · DOI · Paper page
  19. L. Su and N. H. Vaidya . Byzantine multi-agent optimization: Part I. arXiv preprint arXiv:1506.04681 , 2015 . L. Su and N. H. Vaidya. Byzantine multi-agent optimization: Part I. arXiv preprint arXiv:1506.04681, 2015. · arXiv
  20. L. Su and N. H. Vaidya . Byzantine multi-agent optimization: Part II. CoRR, abs/1507.01845 , 2015 . L. Su and N. H. Vaidya. Byzantine multi-agent optimization: Part II. CoRR, abs/1507.01845, 2015. · arXiv
  21. L. Su and N. H. Vaidya . Fault-tolerant distributed optimization (Part IV): Constrained optimization with arbitrary directed networks. arXiv preprint arXiv:1511.01821 , 2015 . L. Su and N. H. Vaidya. Fault-tolerant distributed optimization (Part IV): Constrained optimization with arbitrary directed networks. arXiv preprint arXiv:1511.01821, 2015. · arXiv
  22. 10.1109/ACC.2016.7526806 · DOI
  23. 10.1109/ALLERTON.2015.7447011 · DOI
  24. 10.1007/978-3-642-35668-1_6 · doi:10.1007/978-3-642-35668-1_6
  25. 10.1007/978-3-319-09581-3_7 · DOI
  26. J. N. Tsitsiklis . Problems in decentralized decision making and computation. Technical report , DTIC Document , 1984 . J. N. Tsitsiklis. Problems in decentralized decision making and computation. Technical report, DTIC Document, 1984.
  27. 10.1007/978-3-642-45249-9_2 · doi:10.1007/978-3-642-45249-9_2
  28. 10.1145/2484239.2484256 · DOI
  29. 10.1145/2332432.2332505 · DOI · Paper page

Cited by

See all 125

Metadata

Authors
Su, L., & Vaidya, N. H.
Venue
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Publisher
ACM
Published
2016-07-25
Pages
425-434
OpenAlex
W2490498838
Cited by
125
References
5
FWCI
14.04
Type
conference paper
Language
en
Open access
closed
Funders
NSF (1329681, 1421918)

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

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.