Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics
Anit Kumar Sahu, Soummya Kar, Jose' M. F. Moura, H. Vincent Poor

TL;DR
This paper introduces a distributed recursive nonlinear least squares estimator for multi-agent networks, proving its consistency, asymptotic normality, and optimal convergence rates under weak connectivity and observability conditions.
Contribution
It proposes the CIWNLS algorithm for distributed nonlinear least squares estimation, establishing its theoretical properties and asymptotic performance in multi-agent systems.
Findings
Estimator achieves consistency under weak connectivity.
Estimates are asymptotically normal with optimal convergence rates.
Simulation results verify theoretical analysis.
Abstract
This paper focuses on the problem of recursive nonlinear least squares parameter estimation in multi-agent networks, in which the individual agents observe sequentially over time an independent and identically distributed (i.i.d.) time-series consisting of a nonlinear function of the true but unknown parameter corrupted by noise. A distributed recursive estimator of the \emph{consensus} + \emph{innovations} type, namely , is proposed, in which the agents update their parameter estimates at each observation sampling epoch in a collaborative way by simultaneously processing the latest locally sensed information~(\emph{innovations}) and the parameter estimates from other agents~(\emph{consensus}) in the local neighborhood conforming to a pre-specified inter-agent communication topology. Under rather weak conditions on the connectivity of the inter-agent communication and…
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.
