Computationally Efficient Bayesian Learning of Gaussian Process State Space Models
Andreas Svensson, Arno Solin, Simo Särkkä, Thomas Schön
Abstract
Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models can be conducted using a carefully crafted particle MCMC algorithm. This scheme is computationally efficient and yet allows for a fully Bayesian treatment of the problem. Compared to conventional system identification tools or existing learning methods, we show competitive performance and reliable quantification of uncertainties in the model.
BibTeX
@InProceedings{pmlr-v51-svensson16,
title = {Computationally Efficient Bayesian Learning of Gaussian Process State Space Models},
author = {Svensson, Andreas and Solin, Arno and Särkkä, Simo and Schön, Thomas},
booktitle = {Proceedings of the 19th International Conference on Artificial Intelligence and Statistics},
pages = {213--221},
year = {2016},
editor = {Gretton, Arthur and Robert, Christian C.},
volume = {51},
series = {Proceedings of Machine Learning Research},
address = {Cadiz, Spain},
month = {09--11 May},
publisher = {PMLR},
pdf = {http://proceedings.mlr.press/v51/svensson16.pdf},
url = {https://proceedings.mlr.press/v51/svensson16.html},
abstract = {Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models can be conducted using a carefully crafted particle MCMC algorithm. This scheme is computationally efficient and yet allows for a fully Bayesian treatment of the problem. Compared to conventional system identification tools or existing learning methods, we show competitive performance and reliable quantification of uncertainties in the model.}
}