Skip to main navigation Skip to search Skip to main content

A variable step-size adaptive algorithm under maximum correntropy criterion

  • Xi'an Jiaotong University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Correntropy, a novel localized similarity measure defined in kernel space, has been successfully used as a cost function in adaptive system training. The adaptive algorithms under the maximum correntropy criterion (MCC) have been shown to be robust to impulsive non-Gaussian noises. However, they may converge slowly especially at a region far from the optimal solution. In this paper, we propose a new MCC algorithm with a variable step-size (VSS) called the VSS-MCC algorithm, which may achieve a much faster convergence speed while maintaining similar steady-state performance. In the new algorithm, the step-size is updated based on an approximation for the curvature of performance surface. Simulation results demonstrate the superior performance of VSS-MCC compared with the original MCC algorithm.

Original languageEnglish
Title of host publication2015 International Joint Conference on Neural Networks, IJCNN 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479919604, 9781479919604, 9781479919604, 9781479919604
DOIs
StatePublished - 28 Sep 2015
EventInternational Joint Conference on Neural Networks, IJCNN 2015 - Killarney, Ireland
Duration: 12 Jul 201517 Jul 2015

Publication series

NameProceedings of the International Joint Conference on Neural Networks
Volume2015-September

Conference

ConferenceInternational Joint Conference on Neural Networks, IJCNN 2015
Country/TerritoryIreland
CityKillarney
Period12/07/1517/07/15

Keywords

  • correntropy
  • maximum correntropy criterion (MCC) curvature
  • variable step size

Fingerprint

Dive into the research topics of 'A variable step-size adaptive algorithm under maximum correntropy criterion'. Together they form a unique fingerprint.

Cite this