# Structure Parameter Optimized Kernel Based Online Prediction with a Generalized Optimization Strategy for Nonstationary Time Series

arXiv: https://arxiv.org/abs/2108.08180 · HTML: https://mlsanity.com/paper/2108.08180/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 52 references that are in the map.
- First posted on arXiv 18 Aug 2021.

## Builds on (most cited first, 5 of 5)

- [The CMA Evolution Strategy: A Tutorial](https://mlsanity.com/paper/1604.00772/) (2016)
- [Online Selection of CMA-ES Variants](https://mlsanity.com/paper/1904.07801/) (2019)
- [Kernel Least Mean Square with Adaptive Kernel Size](https://mlsanity.com/paper/1401.5899/) (2014)
- [Approximation errors of online sparsification criteria](https://mlsanity.com/paper/1409.6046/) (2014)
- [Robust Non-linear Regression: A Greedy Approach Employing Kernels with Application to Image Denoising](https://mlsanity.com/paper/1601.00595/) (2016)

## Abstract (arXiv)

In this paper, sparsification techniques aided online prediction algorithms in a reproducing kernel Hilbert space are studied for nonstationary time series. The online prediction algorithms as usual consist of the selection of kernel structure parameters and the kernel weight vector updating. For structure parameters, the kernel dictionary is selected by some sparsification techniques with online selective modeling criteria, and moreover the kernel covariance matrix is intermittently optimized in the light of the covariance matrix adaptation evolution strategy (CMA-ES). Optimizing the real symmetric covariance matrix can not only improve the kernel structure's flexibility by the cross relatedness of the input variables, but also partly alleviate the prediction uncertainty caused by the kernel dictionary selection for nonstationary time series. In order to sufficiently capture the underlying dynamic characteristics in prediction-error time series, a generalized optimization strategy is designed to construct the kernel dictionary sequentially in multiple kernel connection modes. The generalized optimization strategy provides a more self-contained way to construct the entire kernel connections, which enhances the ability to adaptively track the changing dynamic characteristics. Numerical simulations have demonstrated that the proposed approach has superior prediction performance for nonstationary time series.