A Robust Diffusion Adaptive Network Based on the Maximum Correntropy Criterion

W. Bazzi, A. Rastegarnia, A. Khalili
{"title":"A Robust Diffusion Adaptive Network Based on the Maximum Correntropy Criterion","authors":"W. Bazzi, A. Rastegarnia, A. Khalili","doi":"10.1109/ICCCN.2015.7288369","DOIUrl":null,"url":null,"abstract":"Adaptive estimation over distributed networks has received a lot of attention due to its broad range of applications. A useful estimation strategy is diffusion adaptive network, where the parameters of interest can be well estimated from noisy measurements through diffusion cooperation between nodes. The conventional diffusion algorithms exhibit good performance in the presence of Gaussian noise but their performance decreases in presence of impulsive noise. The aim of the present paper is to propose a robust diffusion based algorithm that alleviates the effect of impulsive noise. To this end, we move beyond mean squared error (MSE) criterion and recast the estimation problem in terms of the maximum correntropy criterion (MCC). We use stochastic gradient ascent and useful approximations to derive an adaptive algorithm which is appropriate for distributed implementation. The resultant algorithm has the computational simplicity of the popular LMS algorithm, along with the robustness that is obtained by using higher order moments. We present some simulations results which show that the proposed algorithm outperforms existing alternative that rely MSE criterion.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Adaptive estimation over distributed networks has received a lot of attention due to its broad range of applications. A useful estimation strategy is diffusion adaptive network, where the parameters of interest can be well estimated from noisy measurements through diffusion cooperation between nodes. The conventional diffusion algorithms exhibit good performance in the presence of Gaussian noise but their performance decreases in presence of impulsive noise. The aim of the present paper is to propose a robust diffusion based algorithm that alleviates the effect of impulsive noise. To this end, we move beyond mean squared error (MSE) criterion and recast the estimation problem in terms of the maximum correntropy criterion (MCC). We use stochastic gradient ascent and useful approximations to derive an adaptive algorithm which is appropriate for distributed implementation. The resultant algorithm has the computational simplicity of the popular LMS algorithm, along with the robustness that is obtained by using higher order moments. We present some simulations results which show that the proposed algorithm outperforms existing alternative that rely MSE criterion.
基于最大熵准则的鲁棒扩散自适应网络
分布式网络的自适应估计由于其广泛的应用受到了广泛的关注。一种有用的估计策略是扩散自适应网络,通过节点间的扩散合作,可以很好地从噪声测量中估计出感兴趣的参数。传统的扩散算法在高斯噪声存在时性能良好,但在脉冲噪声存在时性能下降。本文的目的是提出一种基于鲁棒扩散的算法来减轻脉冲噪声的影响。为此,我们超越均方误差(MSE)标准,并根据最大相关系数标准(MCC)重新定义估计问题。我们使用随机梯度上升和有用的近似推导出适合分布式实现的自适应算法。所得到的算法具有流行的LMS算法的计算简单性,以及通过使用高阶矩获得的鲁棒性。仿真结果表明,该算法优于现有的基于MSE准则的替代算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信