Asymptotically Efficient Distributed Estimation With Exponential Family Statistics
Soummya Kar, Jose Moura

TL;DR
This paper introduces a distributed estimation algorithm for multi-agent networks with exponential family data, achieving asymptotic efficiency comparable to centralized methods under certain network conditions.
Contribution
It proposes a novel distributed estimator that is asymptotically efficient and suitable for exponential family statistics, advancing the theory of distributed stochastic approximation.
Findings
Estimator achieves consistency under global observability and mean connectivity.
Estimates' asymptotic covariance matches the centralized Fisher information inverse.
The approach extends the theory of non-Markovian mixed timescale stochastic recursions.
Abstract
The paper studies the problem of distributed parameter estimation in multi-agent networks with exponential family observation statistics. A certainty-equivalence type distributed estimator of the consensus + innovations form is proposed in which, at each each observation sampling epoch agents update their local parameter estimates by appropriately combining the data received from their neighbors and the locally sensed new information (innovation). Under global observability of the networked sensing model, i.e., the ability to distinguish between different instances of the parameter value based on the joint observation statistics, and mean connectivity of the inter-agent communication network, the proposed estimator is shown to yield consistent parameter estimates at each network agent. Further, it is shown that the distributed estimator is asymptotically efficient, in that, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
