The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections

DOI10.1007/S10994-019-05816-ZzbMath1447.62033OpenAlexW2950429510WikidataQ127672187 ScholiaQ127672187MaRDI QIDQ2008642

Gregor H. W. Gebhardt, Gerhard Neumann, Andras Kupcsik

Publication date: 26 November 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-019-05816-z

zbMATH Keywords

state estimationkernel methodsnonparametric inferencemodel learning

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections

Uses Software

• CMA-ES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral algorithm for learning hidden Markov models
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections
• Sparse On-Line Gaussian Processes
• A Hilbert Space Embedding for Distributions
• Learning Nonlinear Generative Models of Time Series With a Kalman Filter in RKHS
• Theory of Reproducing Kernels

This page was built for publication: The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections