A Review of Multiple Try MCMC algorithms for Signal Processing

Abstract

Many applications in signal processing require the estimation of some parameters of interest given a set of observed data. More specifically, Bayesian inference needs the computation of {\it a-posteriori} estimators which are often expressed as complicated multi-dimensional integrals. Unfortunately, analytical expressions for these estimators cannot be found in most real-world applications, and Monte Carlo methods are the only feasible approach. A very powerful class of Monte Carlo techniques is formed by the Markov Chain Monte Carlo (MCMC) algorithms. They generate a Markov chain such that its stationary distribution coincides with the target posterior density. In this work, we perform a thorough review of MCMC methods using multiple candidates in order to select the next state of the chain, at each iteration. With respect to the classical Metropolis-Hastings method, the use of multiple try techniques foster the exploration of the sample space. We present different Multiple Try Metropolis schemes, Ensemble MCMC methods, Particle Metropolis-Hastings algorithms and the Delayed Rejection Metropolis technique. We highlight limitations, benefits, connections and differences among the different methods, and compare them by numerical simulations.

Digital Signal Processing, 2018

References in corpus (4)

• The pseudo-marginal approach for efficient Monte Carlo computations
• Cooperative Parallel Particle Filters for online model selection and applications to Urban Mobility
• MCMC Using Ensembles of States for Problems with Fast and Slow Variables such as Gaussian Process Regression
• Locally weighted Markov chain Monte Carlo

Cited by in corpus (20)

• A Survey of Monte Carlo Methods for Parameter Estimation
• Marginal likelihood computation for model selection and hypothesis testing: an extensive review
• Eryn : A multi-purpose sampler for Bayesian inference
• Uncovering gravitational-wave backgrounds from noises of unknown shape with LISA
• Searching for continuous phase transitions in 5D SU(2) lattice gauge theory
• Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers
• Computing Bayes: From Then 'Til Now'
• Metropolis-Hastings view on variational inference and adversarial training
• A state space approach to dynamic modeling of mouse-tracking data
• A Bayesian inference and model selection algorithm with an optimisation scheme to infer the model noise power
• Efficient sampling of non log-concave posterior distributions with mixture of noises
• Markov Chain Monte Carlo for generating ranked textual data
• Extracting overlapping gravitational-wave signals of galactic compact binaries: a mini review
• Adaptive posterior distributions for uncertainty analysis of covariance matrices in Bayesian inversion problems for multioutput signals
• Sampling by Divergence Minimization
• Convergence Rate of Multiple-try Metropolis Independent sampler
• Sampling and statistical physics via symmetry
• Compressed particle methods for expensive models with application in Astronomy and Remote Sensing
• Fast Markov Chain Monte Carlo Algorithms via Lie Groups
• Fast Bayesian analysis of individual binaries in pulsar timing array data