Resilient Distributed Estimation Through Adversary Detection

Abstract

This paper studies resilient multi-agent distributed estimation of an unknown vector parameter when a subset of the agents is adversarial. We present and analyze a Flag Raising Distributed Estimator ($\mathcal{F}\mathcal{RD}\mathcal{E}$) that allows the agents under attack to perform accurate parameter estimation and detect the adversarial agents. The $\mathcal{F}\mathcal{RD}\mathcal{E}$ algorithm is a consensus+innovations estimator in which agents combine estimates of neighboring agents (consensus) with local sensing information (innovations). We establish that, under $\mathcal{F}\mathcal{RD}\mathcal{E}$, either the uncompromised agents' estimates are almost surely consistent or the uncompromised agents detect compromised agents if and only if the network of uncompromised agents is connected and globally observable. Numerical examples illustrate the performance of $\mathcal{F}\mathcal{RD}\mathcal{E}$.

Cited by in corpus (12)

• Adversary-resilient Distributed and Decentralized Statistical Inference and Machine Learning: An Overview of Recent Advances Under the Byzantine Threat Model
• The Internet of Things: Secure Distributed Inference
• Resilient Distributed Parameter Estimation with Heterogeneous Data
• Resilient Distributed Diffusion in Networks with Adversaries
• Byzantine Fault Tolerant Distributed Linear Regression
• Cybersecurity in Distributed and Fully-Decentralized Optimization: Distortions, Noise Injection, and ADMM
• Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements
• Resilience in Collaborative Optimization: Redundant and Independent Cost Functions
• Approximate Byzantine Fault-Tolerance in Distributed Optimization
• Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent
• Resilient Distributed Field Estimation
• Resilient Consensus Through Event-based Communication