Recurrent Kalman networks : factorized inference in high-dimensional deep feature spaces

Becker, P. and Pandya, H. and Gebhardt, G. and Zhao, C. and Taylor, C. James and Neumann, G. (2019) Recurrent Kalman networks : factorized inference in high-dimensional deep feature spaces. In: Proceedings of Machine Learning Research (PMLR) :. Proceedings of Machine Learning Research (PMLR), 97 . UNSPECIFIED, pp. 544-552.

Text (19icml_kalman)
19icml_kalman.pdf - Accepted Version
Available under License Unspecified.
Download (534kB)

Text (19icml_kalman_supp)
19icml_kalman_supp.pdf - Other
Download (425kB)

Abstract

In order to integrate uncertainty estimates into deep time-series modelling, Kalman Filters (KFs) have been integrated with deep learning models; however, such approaches typically rely on approximate inference techniques such as variational inference which makes learning more complex and often less scalable due to approximation errors. We propose a new deep approach to Kalman filtering which can be learned directly in an end-to-end manner using backpropagation without additional approximations. Our approach uses a high-dimensional factorized latent state representation for which the Kalman updates simplify to scalar operations and thus avoids hard to backpropagate, computationally heavy and potentially unstable matrix inversions. Moreover, we use locally linear dynamic models to efficiently propagate the latent state to the next time step. The resulting network architecture, which we call Recurrent Kalman Network (RKN), can be used for any time-series data, similar to a LSTM (Hochreiter & Schmidhuber, 1997) but uses an explicit representation of uncertainty. As shown by our experiments, the RKN obtains much more accurate uncertainty estimates than an LSTM or Gated Recurrent Units (GRUs) (Cho et al., 2014) while also showing a slightly improved prediction performance and outperforms various recent generative models on an image imputation task.