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 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...

En estimation bayésienne, lorsque le calcul explicite de la loi a posteriori du vecteur des paramètres à estimer est impossible, les méthodes de Monte-Carlo par chaînes de Markov (MCMC) [Robert and Casella, 1999] permettent théoriquement de fournir un échantillon approximativement...

For numerous models, it is impossible to conduct an exact Bayesian inference. There are many cases where the derivation of the posterior distribution leads to intractable calculations (due to the fact that this generally involves intractable integrations). The Bayesian computational literature...