Convergence analysis of kernel LMS algorithm with pre-tuned dictionary
The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a finite-order model. This dictionary has a significant impact on performance, and requires careful consideration. Theoretical analysis of KLMS as a function of dictionary setting has rarely, if ever, been addressed in the literature. In an analysis previously published by the authors, the dictionary elements were assumed to be governed by the same probability density function of the input data. In this paper, we modify this study by considering the dictionary as part of the filter parameters to be set. This theoretical analysis paves the way for future investigations on KLMS dictionary design.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online dictionary learning for kernel LMS. Analysis and forward-backward splitting algorithm
Adaptive filtering algorithms operating in reproducing kernel Hilbert spaces have demonstrated superiority over their linear counterpart for nonlinear system identification. Unfortunately, an undesirable characteristic o…
Dictionary LearningConvergence of Graph Laplacian with kNN Self-tuned Kernels
Kernelized Gram matrix $W$ constructed from data points $\{x_i\}_{i=1}^N$ as $W_{ij}= k_0( \frac{ \| x_i - x_j \|^2} {\sigma^2} )$ is widely used in graph-based geometric data analysis and unsupervised learning. An impor…
Study of Set-Membership Adaptive Kernel Algorithms
In the last decade, a considerable research effort has been devoted to developing adaptive algorithms based on kernel functions. One of the main features of these algorithms is that they form a family of universal approx…
Time SeriesTime Series AnalysisEquiangular Kernel Dictionary Learning With Applications to Dynamic Texture Analysis
Most existing dictionary learning algorithms consider a linear sparse model, which often cannot effectively characterize the nonlinear properties present in many types of visual data, e.g. dynamic texture (DT). Such non…
Computational EfficiencyDictionary LearningTexture ClassificationOnline Nonlinear Estimation via Iterative L2-Space Projections: Reproducing Kernel of Subspace
We propose a novel online learning paradigm for nonlinear-function estimation tasks based on the iterative projections in the L2 space with probability measure reflecting the stochastic property of input signals. The pro…