Gibbs flow for approximate transport with applications to Bayesian computation
arXiv:1509.08787
Abstract
Let and be two distributions on the Borel space . Any measurable function such that if is called a transport map from to . For any and , if one could obtain an analytical expression for a transport map from to , then this could be straightforwardly applied to sample from any distribution. One would map draws from an easy-to-sample distribution to the target distribution using this transport map. Although it is usually impossible to obtain an explicit transport map for complex target distributions, we show here how to build a tractable approximation of a novel transport map. This is achieved by moving samples from using an ordinary differential equation with a velocity field that depends on the full conditional distributions of the target. Even when this ordinary differential equation is time-discretized and the full conditional distributions are numerically approximated, the resulting distribution of mapped samples can be efficiently evaluated and used as a proposal within sequential Monte Carlo samplers. We demonstrate significant gains over state-of-the-art sequential Monte Carlo samplers at a fixed computational complexity on a variety of applications.
Significantly revised with new methodology and numerical examples
References in corpus (2)
Cited by in corpus (9)
- Particle Filtering with Invertible Particle Flow
- 2-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANs
- Invertible Particle Flow-based Sequential MCMC with extension to Gaussian Mixture noise models
- Inference via low-dimensional couplings
- Schrödinger Bridge Samplers
- Annealed Flow Transport Monte Carlo
- Constructing sampling schemes via coupling: Markov semigroups and optimal transport
- Sequential Ensemble Transform for Bayesian Inverse Problems
- Optimal Transportation Methods in Nonlinear Filtering: The feedback particle filter