arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.00441stat.ML
收藏

核风险敏感损失:定义、性质及其在鲁棒自适应滤波中的应用

Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering

Badong Chen, Lei Xing, Bin Xu, Haiquan Zhao, Nanning Zheng, Jose C. Principe

摘要:

定义在核空间中的非线性相似性度量,如相关熵,可以提取数据的高阶顺序统计量,并提供潜在的显着性能改善,特别是在非高斯信号处理和机器学习。在这项工作中,我们提出了一个新的相似性度量在核空间,称为核风险敏感损失(KRSL),并提供了一些重要的性质。将KRSL算法应用于自适应滤波中,研究了其鲁棒性,并在此基础上提出了MKRSL算法,分析了其均方收敛性能。与相关熵相比,KRSL可以提供更有效的性能表面,从而使基于梯度的方法能够实现更快的收敛速度和更高的精度,同时仍然保持对离群值的鲁棒性。仿真结果验证了理论分析结果和新算法的优越性能。

英文摘要:

Nonlinear similarity measures defined in kernel space, such as correntropy, can extract higher-order statistics of data and offer potentially significant performance improvement over their linear counterparts especially in non-Gaussian signal processing and machine learning. In this work, we propose a new similarity measure in kernel space, called the kernel risk-sensitive loss (KRSL), and provide some important properties. We apply the KRSL to adaptive filtering and investigate the robustness, and then develop the MKRSL algorithm and analyze the mean square convergence performance. Compared with correntropy, the KRSL can offer a more efficient performance surface, thereby enabling a gradient based method to achieve faster convergence speed and higher accuracy while still maintaining the robustness to outliers. Theoretical analysis results and superior performance of the new algorithm are confirmed by simulation.

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

↑