Log In Sign Up

Penalised t-walk MCMC

by   Felipe J Medina-Aguayo, et al.

Handling multimodality that commonly arises from complicated statistical models remains a challenge. Current Markov chain Monte Carlo (MCMC) methodology tackling this subject is based on an ensemble of chains targeting a product of power-tempered distributions. Despite the theoretical validity of such methods, practical implementations typically suffer from bad mixing and slow convergence due to the high-computation cost involved. In this work we study novel extensions of the t-walk algorithm, an existing MCMC method that is inexpensive and invariant to affine transformations of the state space, for dealing with multimodal distributions. We acknowledge that the effectiveness of the new method will be problem dependent and might struggle in complex scenarios; for such cases we propose a post-processing technique based on pseudo-marginal theory for combining isolated samples.


page 14

page 15


Unbiased Markov chain Monte Carlo for intractable target distributions

Performing numerical integration when the integrand itself cannot be eva...

Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo

Markov chain Monte Carlo (MCMC) is a powerful methodology for the approx...

Adaptive MCMC via Combining Local Samplers

Markov chain Monte Carlo (MCMC) methods are widely used in machine learn...

Orthogonal parallel MCMC methods for sampling and optimization

Monte Carlo (MC) methods are widely used for Bayesian inference and opti...

Mental Sampling in Multimodal Representations

Both resources in the natural environment and concepts in a semantic spa...

On the use of ABC-MCMC with inflated tolerance and post-correction

Approximate Bayesian computation (ABC) allows for inference of complicat...

emcee v3: A Python ensemble sampling toolkit for affine-invariant MCMC

emcee is a Python library implementing a class of affine-invariant ensem...