The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Distributed Optimization Under Adversarial Nodes
Open accessAbstract
We investigate the vulnerabilities of consensus-based distributed optimization protocols to nodes that deviate from the prescribed update rule (e.g., due to failures or adversarial attacks). We first characterize certain fundamental limitations on the performance of any distributed optimization algorithm in the presence of adversaries. We then propose a secure distributed optimization algorithm that guarantees that the nonadversarial nodes converge to the convex hull of the minimizers of their local functions under the certain conditions on the graph topology, regardless of the actions of a certain number of the adversarial nodes. In particular, we provide sufficient conditions on the graph topology to tolerate a bounded number of adversaries in the neighborhood of every nonadversarial node, and necessary and sufficient conditions to tolerate a globally bounded number of adversaries. For situations, where there are up to F adversaries in the neighborhood of every node, we use the concept of maximal F-local sets of graphs to provide lower bounds on the distance-to-optimality of achievable solutions under any algorithm. We show that finding the size of such sets is NP-hard.
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Distributed 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 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
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
Self-citationOn 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
Resilient Asymptotic Consensus in Robust Networks
LeBlanc, H. J., Zhang, H., Koutsoukos, X., & Sundaram, S. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130413 · Cited by 730
Self-citationReaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657005 · Cited by 563
Consensus Computation in Unreliable Networks: A System Theoretic Approach
Pasqualetti, F., Bicchi, A., & Bullo, F. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2158130 · Cited by 541
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Sundaram, S., & Hadjicostis, C. N. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2088690 · Cited by 472
Self-citationA control perspective for centralized and distributed convex optimization
Wang, J., & Elia, N. (2011) · IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6161503 · Cited by 398
Control approach to distributed optimization
Wang, J., & Elia, N. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706956 · Cited by 358
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
Johansson, B., Rabi, M., & Johansson, M. (2010) · SIAM Journal on Optimization · doi:10.1137/08073038x · Cited by 336
Optimal Scaling of a Gradient Method for Distributed Resource Allocation
Xiao, L., & Boyd, S. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9080-1 · Cited by 326
Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate
Ghaderi, J., & Srikant, R. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.034 · Cited by 325
Binary Opinion Dynamics with Stubborn Agents
Yildiz, E., Ozdaglar, A., Acemoglu, D., Saberi, A., & Scaglione, A. (2013) · ACM Transactions on Economics and Computation · doi:10.1145/2538508 · Cited by 321
Iterative approximate byzantine consensus in arbitrary directed graphs
Vaidya, N. H., Tseng, L., & Liang, G. (2012) · Proceedings of the 2012 ACM symposium on Principles of distributed computing · doi:10.1145/2332432.2332505 · Cited by 221
Cooperative distributed multi-agent optimization
Nedić, A., & Ozdaglar, A. (2009) · Convex Optimization in Signal Processing and Communications · doi:10.1017/cbo9780511804458.011 · Cited by 185
A Notion of Robustness in Complex Networks
Zhang, H., Fata, E., & Sundaram, S. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2413551 · Cited by 169
Self-citationBootstrap percolation on the random graph $G_{n,p}$
Janson, S., Łuczak, T., Turova, T. S., & Vallier, T. (2012) · The Annals of Applied Probability · doi:10.1214/11-aap822 · Cited by 154
Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms
Su, L., & Vaidya, N. H. (2016) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2933057.2933105 · Cited by 131
Event-triggered distributed optimization in sensor networks
Wan, P., & Lemmon, M. D. (2009) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.5555/1602165.1602172 · Cited by 108
Consensus-based distributed optimization with malicious nodes
Sundaram, S., & Gharesifard, B. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447011 · Cited by 60
Self-citationByzantine Multi-Agent Optimization: Part IIPreprint
Su, L., & Vaidya, N. H. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.01845 · Cited by 40
Secure local filtering algorithms for distributed optimization
Sundaram, S., & Gharesifard, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798537 · Cited by 13
Self-citation
Cited by
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Optimization for Reinforcement Learning: From a single agent to cooperative agents
Lee, D., He, N., Kamalaruban, P., & Cevher, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2976000 · Cited by 113
Secure Distributed On-Device Learning Networks with Byzantine Adversaries
Dong, Y., Cheng, J., Hossain, M. J., & Leung, V. C. M. (2019) · IEEE Network · doi:10.1109/mnet.2019.1900025 · Cited by 28
Metadata
- Authors
- Sundaram, S., & Gharesifard, B.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-03
- Volume
- 64
- Issue
- 3
- Pages
- 1063-1076
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2472081165
- Cited by
- 274
- References
- 29
- FWCI
- 15.87
- 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
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.