Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics
Author(s): Sahu, Anit Kumar; Kar, Soummya; Moura, Jose MF; Poor, H Vincent
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr15n2g
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sahu, Anit Kumar | - |
dc.contributor.author | Kar, Soummya | - |
dc.contributor.author | Moura, Jose MF | - |
dc.contributor.author | Poor, H Vincent | - |
dc.date.accessioned | 2020-02-19T22:00:07Z | - |
dc.date.available | 2020-02-19T22:00:07Z | - |
dc.date.issued | 2016-12 | en_US |
dc.identifier.citation | Sahu, Anit Kumar, Soummya Kar, José MF Moura, and H. Vincent Poor. "Distributed constrained recursive nonlinear least-squares estimation: Algorithms and asymptotics." IEEE Transactions on Signal and Information Processing over Networks 2, no. 4 (2016): 426-441. doi:10.1109/TSIPN.2016.2618318 | en_US |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr15n2g | - |
dc.description.abstract | This paper focuses on recursive nonlinear least-squares parameter estimation in multiagent networks, where the individual agents observe sequentially over time an independent and identically distributed time-series consisting of a nonlinear function of the true but unknown parameter corrupted by noise. A distributed recursive estimator of the consensus + innovations type, namely CIWNLS, 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 (innovations) and the parameter estimates from other agents (consensus) in the local neighborhood conforming to a prespecified interagent communication topology. Under rather weak conditions on the connectivity of the interagent communication and a global observability criterion, it is shown that, at every network agent, CIWNLS leads to consistent parameter estimates. Furthermore, under standard smoothness assumptions on the local observation functions, the distributed estimator is shown to yield order-optimal convergence rates, i.e., as far as the order of pathwise convergence is concerned, the local parameter estimates at each agent are as good as the optimal centralized nonlinear least-squares estimator that requires access to all the observations across all the agents at all times. To benchmark the performance of the CIWNLS estimator with that of the centralized nonlinear least-squares estimator, the asymptotic normality of the estimate sequence is established, and the asymptotic covariance of the distributed estimator is evaluated. Finally, simulation results are presented that illustrate and verify the analytical findings. | en_US |
dc.format.extent | 426 - 441 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | IEEE Transactions on Signal and Information Processing over Networks | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1109/TSIPN.2016.2618318 | - |
dc.identifier.eissn | 2373-776X | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
OA_DistributedConstrainedRecursiveNonlinearLeastSquaresEstimationAlgorithmsAsymptotics.pdf | 3.44 MB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.