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

二值观测数据的递归网络估计

Recursive Network Estimation From Binary-Valued Observation Data

Yu Xing, Xingkang He, Haitao Fang, Karl Henrik Johansson

摘要:

本文研究了由二值观测值的时间序列递归估计网络的加权邻接矩阵的问题。观察序列是从非线性网络动力学中产生的,其中代理交换和显示二进制输出。给出了观测序列稳定和系统参数可辨识的充分条件。结果表明,在独立的标准高斯扰动的假设下,可以保证系统的稳定性和可辨识性。通过极大似然法将估计问题转化为优化问题,并在独立的标准高斯假设下证明了其解是真参数向量。基于随机逼近技术,提出了一种估计问题的递归算法。证明了算法的强相合性,并分析了算法的收敛速度.最后,数值模拟进行说明的结果,并表明该算法是不敏感的小未建模因素。

英文摘要:

This paper studies the problem of recursively estimating the weighted adjacency matrix of a network out of a temporal sequence of binary-valued observations. The observation sequence is generated from nonlinear networked dynamics in which agents exchange and display binary outputs. Sufficient conditions are given to ensure stability of the observation sequence and identifiability of the system parameters. It is shown that stability and identifiability can be guaranteed under the assumption of independent standard Gaussian disturbances. Via a maximum likelihood approach, the estimation problem is transformed into an optimization problem, and it is verified that its solution is the true parameter vector under the independent standard Gaussian assumption. A recursive algorithm for the estimation problem is then proposed based on stochastic approximation techniques. Its strong consistency is established and convergence rate analyzed. Finally, numerical simulations are conducted to illustrate the results and to show that the proposed algorithm is insensitive to small unmodeled factors.

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

↑