Since its introduction in the early 1990s, the idea of using importance sampling (IS) with Markov chain Monte Carlo (MCMC) has found many applications. This article examines problems associated with its application to repeated evaluation of related posterior distributions with a particular focus on Bayesian model validation. We demonstrate that, in certain applications, the curse of dimensionality can be reduced by a simple modification of IS. In addition to providing new theoretical insight into the behavior of the IS approximation in a wide class of models, our result facilitates the implementation of computationally intensive Bayesian model checks. We illustrate the simplicity, computational savings, and potential inferential advantages ...
12 pages, 4 figures, submitted for the proceedings of MaxEnt 2009In this note, we shortly survey som...
Markov chain Monte Carlo (MCMC) is an approach to parameter inference in Bayesian models that is bas...
Importance sampling methods can be iterated like MCMC algorithms, while being more robust against de...
Since its introduction in the early 90's, the idea of using importance sampling (IS) with Markov cha...
Bayesian inference under a set of priors, called robust Bayesian analysis, allows for estimation of ...
International audienceThis paper surveys some well-established approaches on the approximation of Ba...
The Importance Sampling method is used as an alternative approach to MCMC in repeated Bayesian estim...
International audienceAbstract: The Importance Sampling method is used as an alternative approach to...
Importance sampling is a classical Monte Carlo technique in which a random sample from one probabili...
AbstractUsually, the Bayesian inference of the GARCH model is preferably performed by the Markov Cha...
This paper surveys some well-established approaches on the approximation of Bayes factors used in Ba...
We propose a Monte Carlo algorithm to sample from high dimensional probability distributions that co...
We consider Bayesian inference by importance sampling when the likelihood is analytically intractabl...
Methods for the systematic application of Monte Carlo integration with importance sampling to Bayesi...
We investigate Bayesian alternatives to classical Monte Carlo methods for evaluating integrals. Baye...
12 pages, 4 figures, submitted for the proceedings of MaxEnt 2009In this note, we shortly survey som...
Markov chain Monte Carlo (MCMC) is an approach to parameter inference in Bayesian models that is bas...
Importance sampling methods can be iterated like MCMC algorithms, while being more robust against de...
Since its introduction in the early 90's, the idea of using importance sampling (IS) with Markov cha...
Bayesian inference under a set of priors, called robust Bayesian analysis, allows for estimation of ...
International audienceThis paper surveys some well-established approaches on the approximation of Ba...
The Importance Sampling method is used as an alternative approach to MCMC in repeated Bayesian estim...
International audienceAbstract: The Importance Sampling method is used as an alternative approach to...
Importance sampling is a classical Monte Carlo technique in which a random sample from one probabili...
AbstractUsually, the Bayesian inference of the GARCH model is preferably performed by the Markov Cha...
This paper surveys some well-established approaches on the approximation of Bayes factors used in Ba...
We propose a Monte Carlo algorithm to sample from high dimensional probability distributions that co...
We consider Bayesian inference by importance sampling when the likelihood is analytically intractabl...
Methods for the systematic application of Monte Carlo integration with importance sampling to Bayesi...
We investigate Bayesian alternatives to classical Monte Carlo methods for evaluating integrals. Baye...
12 pages, 4 figures, submitted for the proceedings of MaxEnt 2009In this note, we shortly survey som...
Markov chain Monte Carlo (MCMC) is an approach to parameter inference in Bayesian models that is bas...
Importance sampling methods can be iterated like MCMC algorithms, while being more robust against de...