Online learning with kernels: Overcoming the growing sum problem
Authors:
- 1 September 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15512541,p. 1-6
Abstract
Online kernel algorithms have an important computational drawback. The computational complexity of these algorithms grow linearly over time. This makes these algorithms difficult to use for real time signal processing applications that need to continuously process data over prolonged periods of time. In this paper, we present a way of overcoming this problem. We do so by approximating kernel evaluations using finite dimensional inner products in a randomized feature space. We apply this idea to the Kernel Least Mean Square (KLMS) algorithm, that has recently been proposed as a non-linear extension to the famed LMS algorithm. Our simulations show that using the proposed method, constant computational complexity can be achieved, with no observable loss in performance.Keywords
This publication has 6 references indexed in Scilit:
- Quantized Kernel Least Mean Square AlgorithmIEEE Transactions on Neural Networks and Learning Systems, 2011
- Kernel least mean square algorithm with constrained growthSignal Processing, 2009
- Uniform approximation of functions with random bases2008
- The Kernel Least-Mean-Square AlgorithmIEEE Transactions on Signal Processing, 2008
- Online Learning with KernelsIEEE Transactions on Signal Processing, 2004
- The Perceptron: A Model for Brain Functioning. IReviews of Modern Physics, 1962