Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs
Soummya Kar,Jose M. F. Moura +1 more
TL;DR: The paper establishes a distributed observability condition under which the distributed estimates are consistent and asymptotically normal, and introduces the distributed notion equivalent to the (centralized) Fisher information rate, which is a bound on the mean square error reduction rate of any distributed estimator.
read more
Abstract: This paper considers gossip distributed estimation of a (static) distributed random field (a.k.a., large-scale unknown parameter vector) observed by sparsely interconnected sensors, each of which only observes a small fraction of the field. We consider linear distributed estimators whose structure combines the information flow among sensors (the consensus term resulting from the local gossiping exchange among sensors when they are able to communicate) and the information gathering measured by the sensors (the sensing or innovations term). This leads to mixed time scale algorithms-one time scale associated with the consensus and the other with the innovations. The paper establishes a distributed observability condition (global observability plus mean connectedness) under which the distributed estimates are consistent and asymptotically normal. We introduce the distributed notion equivalent to the (centralized) Fisher information rate, which is a bound on the mean square error reduction rate of any distributed estimator; we show that under the appropriate modeling and structural network communication conditions (gossip protocol) the distributed gossip estimator attains this distributed Fisher information rate, asymptotically achieving the performance of the optimal centralized estimator. Finally, we study the behavior of the distributed gossip estimator when the measurements fade (noise variance grows) with time; in particular, we consider the maximum rate at which the noise variance can grow and still the distributed estimator being consistent, by showing that, as long as the centralized estimator is consistent, the distributed estimator remains consistent.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Convergence of probability measures
Richard F. Bass
- 01 Jan 2011
TL;DR: Weakconvergence methods in metric spaces were studied in this article, with applications sufficient to show their power and utility, and the results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables.
4.1K
Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
Jianshu Chen,Ali H. Sayed +1 more
TL;DR: An adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes, which endow networks with adaptation abilities that enable the individual nodes to continue learning even when the cost function changes with time.
810
•Book
Adaptation, Learning, and Optimization Over Networks
Ali H. Sayed
- 30 Jun 2014
TL;DR: The limits of performance of distributed solutions are examined and procedures that help bring forth their potential more fully are discussed and a useful statistical framework is adopted and performance results that elucidate the mean-square stability, convergence, and steady-state behavior of the learning networks are derived.
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Angelia Nedic,Alex Olshevsky,Michael G. Rabbat +2 more
- 17 Apr 2018
TL;DR: This paper presents an overview of recent work in decentralized optimization and surveys the state-of-theart algorithms and their analyses tailored to these different scenarios, highlighting the role of the network topology.
References
Consensus in Ad Hoc WSNs With Noisy Links— Part I: Distributed Estimation of Deterministic Signals
TL;DR: This work introduces a decentralized scheme for least-squares and best linear unbiased estimation (BLUE) and establishes its convergence in the presence of communication noise and introduces a method of multipliers in conjunction with a block coordinate descent approach to demonstrate how the resultant algorithm can be decomposed into a set of simpler tasks suitable for distributed implementation.
Decentralized Parameter Estimation by Consensus Based Stochastic Approximation
TL;DR: An algorithm for decentralized multi-agent estimation of parameters in linear discrete-time regression models is proposed in the form of a combination of local stochastic approximation algorithms and a global consensus strategy, and an analysis of the asymptotic properties of the proposed algorithm is presented.