Skip to main navigation Skip to search Skip to main content

Kernel robust mixed-norm adaptive filtering

  • Xi'an Jiaotong University

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

16 Scopus citations

Abstract

Kernel methods are powerful for developing a nonlinear learning algorithm in a high-dimensional linear space. The least mean square (LMS) and the least absolute deviation (LAD) are two well-known linear adaptive filtering algorithms. The former performs very well when the noise is Gaussian, while the later possesses desirable performance when the noise has a long-tailed distribution (e.g. alpha-stable distribution). The combination of the LMS and LAD yields a robust mixed-norm (RMN) algorithm. In this paper, we combine the popular kernel methods and the RMN algorithm to develop a new kernel adaptive filtering algorithm, namely the kernel RMN (KRMN) algorithm, which is a robust adaptive algorithm in reproducing kernel Hilbert space (RIOTS). The mean square convergence is analyzed, and the excellent and robust performance of the new algorithm is demonstrated by the simulation results of nonlinear time series prediction.

Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3021-3024
Number of pages4
ISBN (Electronic)9781479914845
DOIs
StatePublished - 3 Sep 2014
Event2014 International Joint Conference on Neural Networks, IJCNN 2014 - Beijing, China
Duration: 6 Jul 201411 Jul 2014

Publication series

NameProceedings of the International Joint Conference on Neural Networks

Conference

Conference2014 International Joint Conference on Neural Networks, IJCNN 2014
Country/TerritoryChina
CityBeijing
Period6/07/1411/07/14

Keywords

  • kernel
  • mixed-norm
  • robust adaptive filtering

Fingerprint

Dive into the research topics of 'Kernel robust mixed-norm adaptive filtering'. Together they form a unique fingerprint.

Cite this