2019
DOI: 10.3390/e21070644
|View full text |Cite
|
Sign up to set email alerts
|

Online Gradient Descent for Kernel-Based Maximum Correntropy Criterion

Abstract: 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 e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…In view of the abnormal and invalid values of the equivalent diameters of floc particles during the coagulation process, maximum correntropy criterion (MCC) [17][18][19] will be introduced in this article, and an optimal method will be proposed to calculate the mean equivalent diameter of floc particles based on MCC.…”
Section: Complexitymentioning
confidence: 99%
“…In view of the abnormal and invalid values of the equivalent diameters of floc particles during the coagulation process, maximum correntropy criterion (MCC) [17][18][19] will be introduced in this article, and an optimal method will be proposed to calculate the mean equivalent diameter of floc particles based on MCC.…”
Section: Complexitymentioning
confidence: 99%