Ensemble sampler for infinite-dimensional inverse problems

10/28/2020
by   Jeremie Coullon, et al.
0

We introduce a new Markov chain Monte Carlo (MCMC) sampler for infinite-dimensional inverse problems. Our new sampler is based on the affine invariant ensemble sampler, which uses interacting walkers to adapt to the covariance structure of the target distribution. We extend this ensemble sampler for the first time to infinite-dimensional function spaces, yielding a highly efficient gradient-free MCMC algorithm. Because our new ensemble sampler does not require gradients or posterior covariance estimates, it is simple to implement and broadly applicable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2018

Bouncy Hybrid Sampler as a Unifying Device

This work introduces a class of rejection-free Markov chain Monte Carlo ...
research
04/13/2018

Infinite dimensional adaptive MCMC for Gaussian processes

Latent Gaussian processes are widely applied in many fields like, statis...
research
02/22/2022

A gradient-free subspace-adjusting ensemble sampler for infinite-dimensional Bayesian inverse problems

Sampling of sharp posteriors in high dimensions is a challenging problem...
research
08/09/2022

Second Order Ensemble Langevin Method for Sampling and Inverse Problems

We propose a sampling method based on an ensemble approximation of secon...
research
11/26/2012

Bayesian learning of noisy Markov decision processes

We consider the inverse reinforcement learning problem, that is, the pro...
research
03/21/2018

Adaptive Sequential MCMC for Combined State and Parameter Estimation

In the case of a linear state space model, we implement an MCMC sampler ...
research
05/26/2021

Lessons Learned and Improvements when Building Screen-Space Samplers with Blue-Noise Error Distribution

Recent work has shown that the error of Monte-Carlo rendering is visuall...

Please sign up or login with your details

Forgot password? Click here to reset