Efficient approximate Bayesian computation coupled with Markov chain Monte Carlo without likelihood

Genetics. 2009 Aug;182(4):1207-18. doi: 10.1534/genetics.109.102509. Epub 2009 Jun 8.

Abstract

Approximate Bayesian computation (ABC) techniques permit inferences in complex demographic models, but are computationally inefficient. A Markov chain Monte Carlo (MCMC) approach has been proposed (Marjoram et al. 2003), but it suffers from computational problems and poor mixing. We propose several methodological developments to overcome the shortcomings of this MCMC approach and hence realize substantial computational advances over standard ABC. The principal idea is to relax the tolerance within MCMC to permit good mixing, but retain a good approximation to the posterior by a combination of subsampling the output and regression adjustment. We also propose to use a partial least-squares (PLS) transformation to choose informative statistics. The accuracy of our approach is examined in the case of the divergence of two populations with and without migration. In that case, our ABC-MCMC approach needs considerably lower computation time to reach the same accuracy than conventional ABC. We then apply our method to a more complex case with the estimation of divergence times and migration rates between three African populations.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Africa
  • Bayes Theorem
  • Emigration and Immigration
  • Humans
  • Likelihood Functions
  • Markov Chains
  • Models, Genetic*
  • Monte Carlo Method
  • Population Dynamics*
  • Probability*
  • Statistics as Topic