Generalized Correntropy for RobustAdaptive Filtering

From MaRDI portal
Publication:4619640

DOI10.1109/TSP.2016.2539127zbMATH Open1414.94113arXiv1504.02931OpenAlexW3024853581MaRDI QIDQ4619640FDOQ4619640

José C. Príncipe, Badong Chen, Haiquan Zhao, Lei Xing, Nanning Zheng

Publication date: 7 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in correntropy is the Gaussian kernel, which is, of course, not always the best choice. In this work, we propose a generalized correntropy that adopts the generalized Gaussian density (GGD) function as the kernel (not necessarily a Mercer kernel), and present some important properties. We further propose the generalized maximum correntropy criterion (GMCC), and apply it to adaptive filtering. An adaptive algorithm, called the GMCC algorithm, is derived, and the mean square convergence performance is studied. We show that the proposed algorithm is very stable and can achieve zero probability of divergence (POD). Simulation results confirm the theoretical expectations and demonstrate the desirable performance of the new algorithm.


Full work available at URL: https://arxiv.org/abs/1504.02931






Cited In (47)






This page was built for publication: Generalized Correntropy for Robust<?Pub _newline ?>Adaptive Filtering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619640)