Kernel Risk-Sensitive Mean <i>p</i>-Power Error Algorithms for Robust Learning
As a nonlinear similarity measure defined in the reproducing kernel Hilbert space (RKHS), the correntropic loss (C-Loss) has been widely applied in robust learning and signal processing. However, the highly non-convex nature of C-Loss results in performance degradation. To address this issue, a conv...
Main Authors: | Tao Zhang, Shiyuan Wang, Haonan Zhang, Kui Xiong, Lin Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/6/588 |
Similar Items
-
A Quantized Kernel Learning Algorithm Using a Minimum Kernel Risk-Sensitive Loss Criterion and Bilateral Gradient Technique
by: Xiong Luo, et al.
Published: (2017-07-01) -
Recursive Minimum Complex Kernel Risk-Sensitive Loss Algorithm
by: Guobing Qian, et al.
Published: (2018-11-01) -
Multikernel Adaptive Filters Under the Minimum Cauchy Kernel Loss Criterion
by: Wei Shi, et al.
Published: (2019-01-01) -
Kernel Adaptive Filters With Feedback Based on Maximum Correntropy
by: Shiyuan Wang, et al.
Published: (2018-01-01) -
Low-Complexity Constrained Recursive Kernel Risk-Sensitive Loss Algorithm
by: Shunling Xiang, et al.
Published: (2022-04-01)