Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)


We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs). The objective is to estimate or track nonlinear functions that are supposed to contain multiple components such as i) linear and nonlinear components and ii) high-and low-frequency components. 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 particular case, the 'sum' space of the RKHSs is isomorphic, under a straightforward correspondence, 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.

Original languageEnglish
Article number7174566
Pages (from-to)6037-6048
Number of pages12
JournalIEEE Transactions on Signal Processing
Issue number22
Publication statusPublished - 2015 Nov 15


  • Cartesian product
  • multikernel adaptive filtering
  • orthogonal projection
  • reproducing kernel Hilbert space

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces'. Together they form a unique fingerprint.

Cite this