Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms
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.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
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 5×
“For the failure-free case, distributed subgradient optimization algorithms indeed exist [9, 19], however, design and analysis of fault-tolerant optimization algorithms for non-smooth cost functions remain open.”
BackgroundInfluentialDistributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351 · cited 6×
“Although the basic evolution relation has been obtained for failure-free distributed algorithms [9, 19, 31, 15], since our effective objective function is time-dependent ( p ( · ) in (11)), their analysis does not apply directly to our problem.”
BackgroundInfluentialPush-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304 · cited 3×
“Similar assumptions on the local functions are standard in past literature on failure-free distributed optimization [9, 19, 31, 6, 13, 15].”
Background
Research works printed but not linked: 29
- 10.1007/11516798_17 · doi:10.1007/11516798_17
- D. P. Bertsekas . Convex Optimization Algorithms . Athena Scientific , 2015 . D. P. Bertsekas. Convex Optimization Algorithms. Athena Scientific, 2015.
- 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
- 10.1006/inco.1993.1043 · doi:10.1006/inco.1993.1043
- 10.1109/TSP.2012.2198470 · DOI · Paper page
- 10.1145/5925.5931 · DOI · Paper page
- 10.1145/5925.5931 · DOI · Paper page
- 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.
- 10.1007/BF01783662 · DOI
- 10.1109/TC.2007.1043 · DOI
- 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
- B. Johansson . On distributed optimization in networked systems . 2008 . B. Johansson. On distributed optimization in networked systems. 2008.
- 10.1145/2185505.2185507 · DOI
- N. A. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
- 10.1145/2488608.2488657 · DOI
- 10.1145/950620.950624 · doi:10.1145/950620.950624
- 10.5555/2670022 · doi:10.5555/2670022
- 10.1007/978-1-4612-5110-1_10 · DOI · Paper page
- 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
- 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
- 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
- 10.1109/ACC.2016.7526806 · DOI
- 10.1109/ALLERTON.2015.7447011 · DOI
- 10.1007/978-3-642-35668-1_6 · doi:10.1007/978-3-642-35668-1_6
- 10.1007/978-3-319-09581-3_7 · doi:10.1007/978-3-319-09581-3_7
- 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.
- 10.1007/978-3-642-45249-9_2 · doi:10.1007/978-3-642-45249-9_2
- 10.1145/2484239.2484256 · DOI
- 10.1145/2332432.2332505 · DOI · Paper page
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“such as median-based aggregators [101, 426], Krum [69], and trimmed mean [426]. Past work has shown that various robust aggregators are provably effective for Byzantine-tolerant distributed learning [372, 69, 101] under appropriate assumptions, even in federated settings [326, 415]. Despite this, Fang et al. [161] rec…”
Background(2017) · neural information processing systems · Cited by 1,413
Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates
Yin, D., Chen, Y., Ramchandran, K., & Bartlett, P. (2018) · arXiv · doi:10.48550/arxiv.1803.01498 · Cited by 1,130
“Other methods have been proposed for Byzantine-robust distributed learning and optimization; e.g., Su and Vaidya (2016a,b).”
MethodDistributed Optimization Under Adversarial Nodes
Sundaram, S., & Gharesifard, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836919 · Cited by 274
Zeno++: Robust Fully Asynchronous SGD
Xie, C., Koyejo, S., & Gupta, I. (2019) · arXiv · doi:10.48550/arxiv.1903.07020 · Cited by 60
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms. https://app.cochat.ai/papers/10.1145/2933057.2933105
- The paper
- Su, L., & Vaidya, N. H. (2016). Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms. Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/2933057.2933105
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.