Distributed Optimization Under Adversarial Nodes
From MaRDI portal
Abstract: 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 resilient distributed optimization algorithm that guarantees that the non-adversarial nodes converge to the convex hull of the minimizers of their local functions under certain conditions on the graph topology, regardless of the actions of a certain number of adversarial nodes. In particular, we provide sufficient conditions on the graph topology to tolerate a bounded number of adversaries in the neighborhood of every non-adversarial 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.
Cited in
(38)- Maximizing the coverage of roadmap graph for optimal motion planning
- Resilient distributed vector consensus using centerpoint
- Resilient output regulation in heterogeneous networked systems under Byzantine agents
- Resilient multi-dimensional consensus in adversarial environment
- Online optimization of LTI systems under persistent attacks: stability, tracking, and robustness
- Secure rendezvous and static containment in multi-agent systems with adversarial intruders
- Distributed secure state estimation for cyber-physical systems under sensor attacks
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
- Byzantine-resilient distributed state estimation: a min-switching approach
- Resilient distributed field estimation
- How to spread adversarial nodes?
- Distributed Adaptive Optimization With Weight-Balancing
- General resilient consensus algorithms
- A distributed optimization algorithm over Markov switching topology under adversarial attack
- Differentially private resilient distributed cooperative online estimation over digraphs
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- A resilient distributed optimization strategy against false data injection attacks
- Resilient consensus‐based distributed optimization under deception attacks
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives
- Resilient penalty function method for distributed constrained optimization under Byzantine attack
- Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches
- Distributed secure state estimation for linear systems against malicious agents through sorting and filtering
- A trust‐based resilient consensus algorithm for distributed optimization considering node and edge attacks
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- Resilient distributed economic dispatch of smart grids under deception attacks
- Mean-square exponential convergence for Byzantine-resilient distributed state estimation
- Distributed Nash equilibrium seeking of aggregative games under networked attacks
- Consensus control and initialization region optimization for leader-following multi-agent systems under time-varying communication delay and consecutive packet dropouts
- On the geometric convergence of Byzantine-resilient distributed optimization algorithms
- On the non-resiliency of subsequence reduced resilient consensus in multiagent networks
- A truthful mechanism design for distributed optimisation algorithms in networks with self-interested agents
- The minimizer of the sum of two strongly convex functions
- Fully distributed self-triggered secure consensus for nonlinear multiagent systems with sequential communication link scaling attacks
- Distributed power economic dispatch algorithm based on hybrid time-delay system framework under DoS attacks
- A variable threshold weight approach to dynamic event-triggered consensus control for leader-following multi-agent systems under asynchronous DoS attacks
- Byzantine-robust distributed vertical learning over time-varying networks
- Resilient fully-distributed reinforcement learning for UAV swarms against general Byzantine attacks
- Distributed algorithm for resource allocation problems under persistent attacks
This page was built for publication: Distributed Optimization Under Adversarial Nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629864)
