Learning stochastic filtering

Abstract

We quantify the performance of approximations to stochastic filtering by the Kullback-Leibler divergence to the optimal Bayesian filter. Using a two-state Markov process that drives a Brownian measurement process as prototypical test case, we compare two stochastic filtering approximations: a static low-pass filter as baseline, and machine learning of Voltera expansions using nonlinear Vector Auto Regression (nVAR). We highlight the crucial role of the chosen performance metric, and present two solutions to the specific challenge of predicting a likelihood bounded between $0$ and $1$.

arXiv comment15 pages, 3 figures

References in corpus (8)

• Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
• Reconciling modern machine learning practice and the bias-variance trade-off
• Next Generation Reservoir Computing
• Data Based Identification and Prediction of Nonlinear and Complex Dynamical Systems
• Nonequilibrium Thermodynamics of Feedback Control
• The Bayesian Second Law of Thermodynamics
• Bayesian gradient sensing in the presence of rotational diffusion
• Research Notes: Gradient sensing in Bayesian chemotaxis