The Kernel Recursive Least-Squares Algorithm
Hebrew University of Jerusalem · McGill University · +1 more institution
Abstract
We present a nonlinear version of the recursive least squares (RLS) algorithm. Our algorithm performs linear regression in a high-dimensional feature space induced by a Mercer kernel and can therefore be used to recursively construct minimum mean-squared-error solutions to nonlinear least-squares problems that are frequently encountered in signal processing applications. In order to regularize solutions and keep the complexity of the algorithm bounded, we use a sequential sparsification process that admits into the kernel representation a new input sample only if its feature space image cannot be sufficiently well approximated by combining the images of previously admitted samples. This sparsification…
Citation impact
- FWCI
- 25.03
- Percentile
- 100%
- References
- 65
Authors
3Topics & keywords
- Algorithm
- Kernel (algebra)
- Mathematics
- Representation (politics)
- Bounded function
- Least-squares function approximation
- Signal processing
- Recursive least squares filter