DeepAI AI Chat
Log In Sign Up

Multiple projection MCMC algorithms on submanifolds

by   Tony Lelièvre, et al.

We propose new Markov Chain Monte Carlo algorithms to sample probability distributions on submanifolds, which generalize previous methods by allowing the use of set-valued maps in the proposal step of the MCMC algorithms. The motivation for this generalization is that the numerical solvers used to project proposed moves to the submanifold of interest may find several solutions. We show that the new algorithms indeed sample the target probability measure correctly, thanks to some carefully enforced reversibility property. We demonstrate the interest of the new MCMC algorithms on illustrative numerical examples.


page 1

page 2

page 3

page 4


Fast Markov Chain Monte Carlo Algorithms via Lie Groups

From basic considerations of the Lie group that preserves a target proba...

Accelerating MCMC algorithms through Bayesian Deep Networks

Markov Chain Monte Carlo (MCMC) algorithms are commonly used for their v...

Nonreversible MCMC from conditional invertible transforms: a complete recipe with convergence guarantees

Markov Chain Monte Carlo (MCMC) is a class of algorithms to sample compl...

Finite space Kantorovich problem with an MCMC of table moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...

Conditioning by Projection for the Sampling from Prior Gaussian Distributions

In this work we are interested in the (ill-posed) inverse problem for ab...

Sampler for Composition Ratio by Markov Chain Monte Carlo

Invention involves combination, or more precisely, ratios of composition...

An MCMC Method to Sample from Lattice Distributions

We introduce a Markov Chain Monte Carlo (MCMC) algorithm to generate sam...