Fully Adaptive Gaussian Mixture Metropolis-Hastings Algorithm

Abstract

Markov Chain Monte Carlo methods are widely used in signal processing and communications for statistical inference and stochastic optimization. In this work, we introduce an efficient adaptive Metropolis-Hastings algorithm to draw samples from generic multi-modal and multi-dimensional target distributions. The proposal density is a mixture of Gaussian densities with all parameters (weights, mean vectors and covariance matrices) updated using all the previously generated samples applying simple recursive rules. Numerical results for the one and two-dimensional cases are provided.

References in corpus (1)

• Improved Adaptive Rejection Metropolis Sampling Algorithms

Cited by in corpus (8)

• A Survey of Monte Carlo Methods for Parameter Estimation
• Layered Adaptive Importance Sampling
• A Review of Multiple Try MCMC algorithms for Signal Processing
• Orthogonal parallel MCMC methods for sampling and optimization
• Group Importance Sampling for Particle Filtering and MCMC
• Metropolis Sampling
• A state space approach to dynamic modeling of mouse-tracking data
• Parallel Metropolis chains with cooperative adaptation