$\mathcal{C}\mathcal{I}\mathcal{R}\mathcal{FE}$: A Distributed Random Fields Estimator

Abstract

This paper presents a communication efficient distributed algorithm, $\mathcal{C}\mathcal{I}\mathcal{R}\mathcal{FE}$ of the \emph{consensus}+\emph{innovations} type, to estimate a high-dimensional parameter in a multi-agent network, in which each agent is interested in reconstructing only a few components of the parameter. This problem arises for example when monitoring the high-dimensional distributed state of a large-scale infrastructure with a network of limited capability sensors and where each sensor is tasked with estimating some local components of the state. At each observation sampling epoch, each agent updates its local estimate of the parameter components in its interest set by simultaneously processing the latest locally sensed information~(\emph{innovations}) and the parameter estimates from agents~(\emph{consensus}) in its communication neighborhood given by a time-varying possibly sparse graph. Under minimal conditions on the inter-agent communication network and the sensing models, almost sure convergence of the estimate sequence at each agent to the components of the true parameter in its interest set is established. Furthermore, the paper establishes the performance of $\mathcal{C}\mathcal{I}\mathcal{R}\mathcal{FE}$ in terms of asymptotic covariance of the estimate sequences and specifically characterizes the dependencies of the component wise asymptotic covariance in terms of the number of agents tasked with estimating it. Finally, simulation experiments demonstrate the efficacy of $\mathcal{C}\mathcal{I}\mathcal{R}\mathcal{FE}$.

arXiv comment30 pages. Submitted for journal publication. Initial Submission: Feb 2018, Revised: June 2018

References in corpus (10)

• Distributing the Kalman Filter for Large-Scale Systems
• Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs
• DILAND: An Algorithm for Distributed Sensor Localization with Noisy Distance Measurements
• Distributed Recursive Least-Squares: Stability and Performance Analysis
• Distributed Optimization With Local Domains: Applications in MPC and Network Flows
• Distributed Discrete-time Optimization in Multi-agent Networks Using only Sign of Relative State
• Diffusion LMS for Multitask Problems with Local Linear Equality Constraints
• Nonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphs
• Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics
• Distributed Diffusion-based LMS for Node-Specific Parameter Estimation over Adaptive Networks

Cited by in corpus (6)

• Multitask learning over graphs: An Approach for Distributed, Streaming Machine Learning
• Adaptation and learning over networks under subspace constraints -- Part I: Stability Analysis
• Quantization for decentralized learning under subspace constraints
• Resilient Distributed Recovery of Large Fields
• Decentralized Cooperative Online Estimation With Random Observation Matrices, Communication Graphs and Time Delays
• Resilient Distributed Field Estimation