Fully Adaptive Gaussian Mixture Metropolis-Hastings Algorithm
Computation
2016-03-17 v3 Methodology
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.
Cite
@article{arxiv.1212.0122,
title = {Fully Adaptive Gaussian Mixture Metropolis-Hastings Algorithm},
author = {David Luengo and Luca Martino},
journal= {arXiv preprint arXiv:1212.0122},
year = {2016}
}