Distributed Recursive Least-Squares: Stability and Performance Analysis
Gonzalo Mateos, Georgios B. Giannakis

TL;DR
This paper introduces a distributed recursive least-squares (D-RLS) algorithm for cooperative estimation in wireless sensor networks, analyzing its stability and steady-state performance under realistic noisy communication conditions.
Contribution
It develops a novel D-RLS algorithm with stability analysis and closed-form MSE expressions, enabling efficient, stable distributed estimation without diminishing step-sizes.
Findings
D-RLS achieves stable estimates with finite error bounds.
Theoretical MSE predictions match simulations well.
Stability conditions are practical and easy to verify.
Abstract
The recursive least-squares (RLS) algorithm has well-documented merits for reducing complexity and storage requirements, when it comes to online estimation of stationary signals as well as for tracking slowly-varying nonstationary processes. In this paper, a distributed recursive least-squares (D-RLS) algorithm is developed for cooperative estimation using ad hoc wireless sensor networks. Distributed iterations are obtained by minimizing a separable reformulation of the exponentially-weighted least-squares cost, using the alternating-minimization algorithm. Sensors carry out reduced-complexity tasks locally, and exchange messages with one-hop neighbors to consent on the network-wide estimates adaptively. A steady-state mean-square error (MSE) performance analysis of D-RLS is conducted, by studying a stochastically-driven `averaged' system that approximates the D-RLS dynamics…
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.
