Population Monte Carlo

Importance sampling methods can be iterated like MCMC algorithms. while being more robust against dependence and starting values. The population Monte Carlo principle consists of iterated generations of importance samples, with importance functions depending on the previously generated importance samples. The advantage over MCMC algorithms is that the scheme is unbiased at any iteration and can thus be stopped at anytime. while iterations improve the performances of the importance function. thus leading to an adaptive importance sampling. We illustrate this method on a mixture example with multiscale importance functions. A second example reanalyzes the ion channel model using an importance sampling scheme based on a hidden Markov representation. and compares population Monte Carlo with a corresponding MCMC algorithm.