.png){kind=icon}
返回
Online Distributed Learning Over Graphs With Multitask Graph-Filter Models
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2020.2964214.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we are interested in adaptive and distributed estimation of graph filters from streaming data. We formulate this problem as a consensus estimation problem over graphs, which can be addressed with diffusion LMS strategies. Most popular graph-shift operators such as those based on the graph Laplacian matrix, or the adjacency matrix, are not energy preserving. This may result in an ill-conditioned estimation problem, and reduce the convergence speed of the distributed algorithms. To address this issue and improve the transient performance, we introduce a preconditioned graph diffusion LMS algorithm. We also propose a computationally efficient version of this algorithm by approximating the Hessian matrix with local information. Performance analyses in the mean and mean-square sense are provided. Finally, we consider a more general problem where the filter coefficients to estimate may vary over the graph. To avoid a large estimation bias, we introduce an unsupervised clustering method for splitting the global estimation problem into local ones. Numerical results show the effectiveness of the proposed algorithms and validate the theoretical results.
Keyword:
Graph signal processing
graph filter
diffusion LMS
node-varying graph filter
clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
734
被引数:
1.9K
机构
引用论文
.png){kind=icon}
The Relevance of Contralateral Recordings and Patient Disability to Assessment of Brain-Stem Auditory Evoked Potential Abnormalities in Multiple Sclerosis对侧记录与患者残疾程度在多发性硬化脑干听觉诱发电位异常评估中的相关性
PREAI
分享收藏
查看更多内容