Kernel Center Adaptation in the Reproducing Kernel Hilbert Space Embedding Method
From MaRDI portal
Abstract: The performance of adaptive estimators that employ embedding in reproducing kernel Hilbert spaces (RKHS) depends on the choice of the location of basis kernel centers. Parameter convergence and error approximation rates depend on where and how the kernel centers are distributed in the state-space. In this paper, we develop the theory that relates parameter convergence and approximation rates to the position of kernel centers. We develop criteria for choosing kernel centers in a specific class of systems - ones in which the state trajectory regularly visits the neighborhood of the positive limit set. Two algorithms, based on centroidal Voronoi tessellations and Kohonen self-organizing maps, are derived to choose kernel centers in the RKHS embedding method. Finally, we implement these methods on two practical examples and test their effectiveness.
Recommendations
- Adaptive estimation for nonlinear systems using reproducing kernel Hilbert spaces
- Admissible kernels for RKHS embedding of probability distributions
- Adaptive estimation of external fields in reproducing kernel Hilbert spaces
- Kernel mean shrinkage estimators
- On the optimality of kernel-embedding based goodness-of-fit tests
This page was built for publication: Kernel Center Adaptation in the Reproducing Kernel Hilbert Space Embedding Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348540)
