Likelihood-Free Parallel Tempering

Details Likelihood-Free Parallel Tempering Likelihood-Free Parallel Tempering

2011-08-17

arxiv.org/abs/1108.3423v2

Statistics

Methodology

Scientific paper

Approximate Bayesian Computational (ABC) methods (or likelihood-free methods) have appeared in the past fifteen years as useful methods to perform Bayesian analyses when the likelihood is analytically or computationally intractable. Several ABC methods have been proposed: Monte Carlo Markov Chains (MCMC) methods have been developped by Marjoramet al. (2003) and by Bortotet al. (2007) for instance, and sequential methods have been proposed among others by Sissonet al. (2007), Beaumont et al. (2009) and Del Moral et al. (2009). Until now, while ABC-MCMC methods remain the reference, sequential ABC methods have appeared to outperforms them (see for example McKinley et al. (2009) or Sisson et al. (2007)). In this paper a new algorithm combining population-based MCMC methods with ABC requirements is proposed, using an analogy with the Parallel Tempering algorithm (Geyer, 1991). Performances are compared with existing ABC algorithms on simulations and on a real example.

Affiliated with

Also associated with

No associations

Rating

Likelihood-Free Parallel Tempering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Likelihood-Free Parallel Tempering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Likelihood-Free Parallel Tempering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540087