.png){kind=icon}
返回
Adaptive multitask network based on maximum correntropy learning algorithm
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.2760.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Adaptive networks solve distributed optimization problems in which all agents of the network are interested to collaborate with their neighbors to learn a similar task. Collaboration is useful when all agents seek a similar task. However, in many applications, agents may belong to different clusters that seek dissimilar tasks. In this case, nonselective collaboration will lead to damaging results that are worse than noncooperative solution. In this paper, we contribute in problems that several clusters of interconnected agents are interested in learning multiple tasks. To address multitask learning problem, we consider an information theoretic criterion called correntropy in a distributed manner providing a novel adaptive combination policy that allows agents to learn which neighbors they should cooperate with and which other neighbors they should reject. In doing so, the proposed algorithm enables agents to recognize their clusters and to achieve improved learning performance compared with noncooperative strategy. Stability analysis in the mean sense and also a closed-form relation determining the network error performance in steady-state mean-square-deviation is derived. Simulation results illustrate the theoretical findings and match well with theory.
Keyword:
adaptive network
correntropy criterion
distributed processing
multitask learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
2.6K
被引数:
3.6K
机构
引用论文
Automated detection scheme for acute myocardial infarction using convolutional neural network and long short-term memory.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
查看更多内容