DISTRIBUTED LINEAR PARAMETER ESTIMATION: ASYMPTOTICALLY EFFICIENT ADAPTIVE STRATEGIES

被引:66
作者
Kar, Soummya [1 ]
Moura, Jose M. F. [1 ]
Poor, H. Vincent [2 ]
机构
[1] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
multiagent systems; distributed estimation; mixed time-scale; stochastic approximation; asymptotically efficient; adaptive algorithms; CONSENSUS ALGORITHMS; OPTIMIZATION; STABILITY; NETWORKS; SYSTEMS; SQUARES; FILTER;
D O I
10.1137/110848396
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the problem of distributed adaptive linear parameter estimation in multiagent inference networks. Local sensing model information is only partially available at the agents, and interagent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which the agents adaptively assess their relative observation quality over time and fuse the innovations accordingly. Under rather weak assumptions on the statistical model and the interagent communication, it is shown that, by properly tuning the consensus potential with respect to the innovation potential, the asymptotic information rate loss incurred in the learning process may be made negligible. As such, it is shown that the agent estimates are asymptotically efficient, in that their asymptotic covariance coincides with that of a centralized estimator (the inverse of the centralized Fisher information rate for Gaussian systems) with perfect global model information and having access to all observations at all times. The proof techniques are mainly based on convergence arguments for non-Markovian mixed time-scale stochastic approximation procedures. Several approximation results developed in the process are of independent interest.
引用
收藏
页码:2200 / 2229
页数:30
相关论文
共 42 条
[1]  
[Anonymous], 1999, CONVERGE PROBAB MEAS
[2]  
Bertsekas D., 1984, TECHNICAL REPORT
[3]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[4]  
Carli R., 2007, Proceedings of the IEEE Conference on Decision and Control, P5486
[5]  
Chung F., 1992, Spectral Graph Theory
[6]   On a decentralized active sensing strategy using mobile sensor platforms in a network [J].
Chung, TH ;
Gupta, V ;
Burdick, JW ;
Murray, RM .
2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, :1914-1919
[7]   Gossip Algorithms for Distributed Signal Processing [J].
Dimakis, Alexandros G. ;
Kar, Soummya ;
Moura, Jose M. F. ;
Rabbat, Michael G. ;
Scaglione, Anna .
PROCEEDINGS OF THE IEEE, 2010, 98 (11) :1847-1864
[8]   A SHARPER FORM OF THE BOREL-CANTELLI LEMMA AND THE STRONG LAW [J].
DUBINS, LE ;
FREEDMAN, DA .
ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (03) :800-807
[9]   ON ASYMPTOTIC NORMALITY IN STOCHASTIC APPROXIMATION [J].
FABIAN, V .
ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (04) :1327-&
[10]   STOCHASTIC APPROXIMATION OF MINIMA WITH IMPROVED ASYMPTOTIC SPEED [J].
FABIAN, V .
ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (01) :191-&