Automatic Backward Filtering Forward Guiding for Markov processes and graphical models
arXiv:2010.03509
Abstract
We incorporate discrete and continuous time Markov processes as building blocks into probabilistic graphical models with latent and observed variables. We introduce the automatic Backward Filtering Forward Guiding (BFFG) paradigm (Mider et al., 2021) for programmable inference on latent states and model parameters. Our starting point is a generative model, a forward description of the probabilistic process dynamics. We backpropagate the information provided by observations through the model to transform the generative (forward) model into a pre-conditional model guided by the data. It approximates the actual conditional model with known likelihood-ratio between the two. The backward filter and the forward change of measure are suitable to be incorporated into a probabilistic programming context because they can be formulated as a set of transformation rules. The guided generative model can be incorporated in different approaches to efficiently sample latent states and parameters conditional on observations. We show applicability in a variety of settings, including Markov chains with discrete state space, interacting particle systems, state space models, branching diffusions and Gamma processes.
43 pages
References in corpus (7)
- The pseudo-marginal approach for efficient Monte Carlo computations
- Tree based functional expansions for Feynman--Kac particle models
- Automatic structured variational inference
- Online Smoothing for Diffusion Processes Observed with Noise
- MonteCarloMeasurements.jl: Nonlinear Propagation of Arbitrary Multivariate Distributions by means of Method Overloading
- Nonparametric Bayesian volatility estimation for gamma-driven stochastic differential equations
- Functional probabilistic programming for scalable Bayesian modelling