Comparison of the Convergence Rates of the New Correntropy-Based Levenberg-Marquardt (CLM) Method and the Fixed-Point Maximum Correntropy (FP-MCC) Algorithm.
Saved in:
| Title: | Comparison of the Convergence Rates of the New Correntropy-Based Levenberg-Marquardt (CLM) Method and the Fixed-Point Maximum Correntropy (FP-MCC) Algorithm. |
|---|---|
| Authors: | Heravi, Ahmad Reza1 ahmadreza.heravi@stu.um.ac.ir, Hodtani, Ghosheh Abed1 hodtani@um.ac.ir |
| Source: | Circuits, Systems & Signal Processing. Jul2018, Vol. 37 Issue 7, p2884-2910. 27p. |
| Subjects: | Regression analysis, Convergence (Telecommunication), Robust optimization, Quadratic fields, Information-theoretic security |
| Abstract: | Correntropy as an efficient information theoretic (ITL) criterion has been extensively applied in many non-Gaussian applications. In order to maximize correntropy, several optimization algorithms have been proposed. Fixed-point maximum correntropy (FP-MCC) and correntropy-based Levenberg-Marquardt (CLM) are the fastest of the proposed methods. As the convergence rate of these operational methods has not been studied before, in this paper we prove the ability of their quadratic convergence from a theoretic point of view and establish the influence of bandwidth on their convergence order. Then, theoretic results are validated through numerical experiments. [ABSTRACT FROM AUTHOR] |
| Copyright of Circuits, Systems & Signal Processing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Correntropy as an efficient information theoretic (ITL) criterion has been extensively applied in many non-Gaussian applications. In order to maximize correntropy, several optimization algorithms have been proposed. Fixed-point maximum correntropy (FP-MCC) and correntropy-based Levenberg-Marquardt (CLM) are the fastest of the proposed methods. As the convergence rate of these operational methods has not been studied before, in this paper we prove the ability of their quadratic convergence from a theoretic point of view and establish the influence of bandwidth on their convergence order. Then, theoretic results are validated through numerical experiments. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 0278081X |
| DOI: | 10.1007/s00034-017-0694-3 |
