LGMLAug 5, 2014

Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces

arXiv:1408.0853v239 citations
AI Analysis

This work addresses function estimation for signal processing or machine learning applications, but it appears incremental as it combines existing methods (multikernel adaptive filtering and HYPASS).

The authors tackled the problem of estimating nonlinear functions with multiple components by proposing an adaptive learning algorithm using iterative orthogonal projections in the Cartesian product of reproducing kernel Hilbert spaces (RKHSs). The efficacy was demonstrated through numerical examples, though no concrete performance numbers were provided.

We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs). The task is estimating/tracking nonlinear functions which are supposed to contain multiple components such as (i) linear and nonlinear components, (ii) high- and low- frequency components etc. In this case, the use of multiple RKHSs permits a compact representation of multicomponent functions. The proposed algorithm is where two different methods of the author meet: multikernel adaptive filtering and the algorithm of hyperplane projection along affine subspace (HYPASS). In a certain particular case, the sum space of the RKHSs is isomorphic to the product space and hence the proposed algorithm can also be regarded as an iterative projection method in the sum space. The efficacy of the proposed algorithm is shown by numerical examples.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes