arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.11686eess.SYcs.SY
收藏

一类分布式最小二乘的收敛性

Convergence of a Distributed Least Squares

Siyu Xie, Yaqi Zhang, Lei Guo

摘要:

在本文中,我们考虑了一个基于最小二乘(LS)的分布式算法建立在传感器网络估计的动力系统的未知参数向量,其中网络中的每个传感器只有部分信息,但允许其邻居进行通信。我们的主要任务是通过建立自适应预测器的累积遗憾的上界和分布式LS估计器的收敛性,将传统LS的著名理论结果推广到当前的分布式情况,与现有的分布式估计文献相比,具有以下关键特征:首先,我们的理论不需要事先强加的独立性,平稳性或高斯性质的系统信号,因此适用于随机系统的反馈。其次,本文所引入的分布式最小二乘估计收敛的合作激励条件是最弱的,这表明即使单个传感器不能用传统的最小二乘估计未知参数,整个网络仍然可以用分布式最小二乘估计完成估计任务。

英文摘要:

In this paper, we consider a least-squares (LS)-based distributed algorithm build on a sensor network to estimate an unknown parameter vector of a dynamical system, where each sensor in the network has partial information only but is allowed to communicate with its neighbors. Our main task is to generalize the well-known theoretical results on the traditional LS to the current distributed case by establishing both the upper bound of the accumulated regrets of the adaptive predictor and the convergence of the distributed LS estimator, with the following key features compared with the existing literature on distributed estimation: Firstly, our theory does not need the previously imposed independence, stationarity or Gaussian property on the system signals, and hence is applicable to stochastic systems with feedback. Secondly, the cooperative excitation condition introduced and used in this paper for the convergence of the distributed LS estimate is the weakest possible one, which shows that even if any individual sensor cannot estimate the unknown parameter by the traditional LS, the whole network can still fulfill the estimation task by the distributed LS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑