期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 65, 期 12, 页码 5503-5509出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2020.2973583
关键词
Convergence; Testing; Bayes methods; Silicon; Acceleration; Transient analysis; Knowledge engineering; Convergence rate; distributed hypothesis testing; historical observations; non-Bayesian learning
资金
- National Natural Science Foundation of China [61621004, 61420106016]
- Research Fund of State Key Laboratory of Synthetical Automation for Process Industries [2018ZCX03]
- Fundamental Research Funds for the Central Universities [N180406001]
This article investigates the problem of distributed hypothesis testing over networks. By introducing double and triple cumulations of historical observations, two novel distributed learning algorithms are developed to solve the considered problem. Within this framework, we study the convergence rates of the proposed algorithms. More specifically: 1) It is proven that the algorithm with double cumulation of historical observations has a faster convergence rate than those of the existing algorithms. 2) Furthermore, it is proven that the algorithm with triple cumulation of historical observations can be further accelerated. Especially, based on the theoretical results, this article shows that a tradeoff among convergence rate, transient performance, and memory burden exists in the proposed algorithms. Finally, simulation examples verify the theoretical results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据