Adaptive importance sampling in general mixture classes
In this paper, we propose an adaptive algorithm that iteratively updates both the weights and component parameters of a mixture importance sampling density so as to optimise the performance of importance sampling, as measured by an entropy criterion. The method, called M-PMC, is shown to be applicable to a wide class of importance sampling densities, which includes in particular mixtures of multivariate Student t distributions. The performance of the proposed scheme is studied on both artificial and real examples, highlighting in particular the benefit of a novel Rao-Blackwellisation device which can be easily incorporated in the updating scheme.
KeywordsImportance sampling Adaptive Monte Carlo Mixture model Entropy Kullback-Leibler divergence EM algorithm Population Monte Carlo
Unable to display preview. Download preview PDF.
- R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna (2006) Google Scholar
- West, M.: Modelling with mixtures. In: Berger, J., Bernardo, J., Dawid, A., Smith, A. (eds.) Bayesian Statistics, vol. 4, pp. 503–525. Oxford University Press, Oxford (1992) Google Scholar