摘要
In the framework of statistical learning, we study the online gradient descent algorithm generated by the correntropy-induced losses in Reproducing kernel Hilbert spaces (RKHS). As a generalized correlation measurement, correntropy has been widely applied in practice, owing to its prominent merits on robustness. Although the online gradient descent method is an efficient way to deal with the maximum correntropy criterion (MCC) in non-parameter estimation, there has been no consistency in analysis or rigorous error bounds. We provide a theoretical understanding of the online algorithm for MCC, and show that, with a suitable chosen scaling parameter, its convergence rate can be min-max optimal (up to a logarithmic factor) in the regression analysis. Our results show that the scaling parameter plays an essential role in both robustness and consistency.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 644 |
| 期刊 | Entropy |
| 卷 | 21 |
| 期 | 7 |
| DOI | |
| 出版状态 | 已出版 - 1 7月 2019 |
| 已对外发布 | 是 |
学术指纹
探究 'Online gradient descent for kernel-based maximum correntropy criterion' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver