arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.02367cs.ITcs.SYeess.SYmath.IT
收藏

一种用于非线性自适应网络的扩散核最小均方算法

A Diffusion Kernel LMS algorithm for nonlinear adaptive networks

Mathematical and Algorithmic Sciences Lab, Huawei France R&D(华为法国研发中心数学与算法科学实验室)

Symeon Chouvardas, Moez Draief

AI总结:

本文提出一种分布式非线性自适应学习算法,通过扩散基核最小二乘算法(KLMS)实现节点协作优化,理论分析证明其无悔界性质,并通过实验验证其优于其他LMS变种。

摘要:

本文提出了一种分布式非线性自适应学习算法。一组节点按时间步序依次获取测量值,这些测量值通过非线性函数相关联,其目标是通过扩散基核最小二乘(KLMS)算法协同最小化成本函数。该算法采用先适应后组合的协作模式。此外,研究了该算法的理论性质,并证明在某些假设下,该算法具有无悔界性质。最后,比较实验验证了所提方案优于其他LMS变种。

英文摘要:

This work presents a distributed algorithm for nonlinear adaptive learning. In particular, a set of nodes obtain measurements, sequentially one per time step, which are related via a nonlinear function; their goal is to collectively minimize a cost function by employing a diffusion based Kernel Least Mean Squares (KLMS). The algorithm follows the Adapt Then Combine mode of cooperation. Moreover, the theoretical properties of the algorithm are studied and it is proved that under certain assumptions the algorithm suffers a no regret bound. Finally, comparative experiments verify that the proposed scheme outperforms other variants of the LMS.

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

↑