A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces
- 2k Downloads
Differential Evolution (DE) is a simple genetic algorithm for numerical optimization in real parameter spaces. In a statistical context one would not just want the optimum but also its uncertainty. The uncertainty distribution can be obtained by a Bayesian analysis (after specifying prior and likelihood) using Markov Chain Monte Carlo (MCMC) simulation. This paper integrates the essential ideas of DE and MCMC, resulting in Differential Evolution Markov Chain (DE-MC). DE-MC is a population MCMC algorithm, in which multiple chains are run in parallel. DE-MC solves an important problem in MCMC, namely that of choosing an appropriate scale and orientation for the jumping distribution. In DE-MC the jumps are simply a fixed multiple of the differences of two random parameter vectors that are currently in the population. The selection process of DE-MC works via the usual Metropolis ratio which defines the probability with which a proposal is accepted. In tests with known uncertainty distributions, the efficiency of DE-MC with respect to random walk Metropolis with optimal multivariate Normal jumps ranged from 68% for small population sizes to 100% for large population sizes and even to 500% for the 97.5% point of a variable from a 50-dimensional Student distribution. Two Bayesian examples illustrate the potential of DE-MC in practice. DE-MC is shown to facilitate multidimensional updates in a multi-chain “Metropolis-within-Gibbs” sampling approach. The advantage of DE-MC over conventional MCMC are simplicity, speed of calculation and convergence, even for nearly collinear parameters and multimodal densities.
KeywordsBlock updating Evolutionary Monte Carlo Metropolis algorithm Population Markov Chain Monte Carlo Simulated Annealing Simulated Tempering Theophylline Kinetics
Unable to display preview. Download preview PDF.
- Gelman A., Carlin J. B., Stern H. S. and Rubin D. B. 2004. Bayesian data analysis, 2nd edition. London, Chapman & Hall.Google Scholar
- Gilks W. R., Richardson S. and Spiegelhalter D. J. 1996. Markov chain monte carlo in practice. London, Chapman & Hall.Google Scholar
- Gilks W. R. and Roberts G. O. 1996. Strategies for improving MCMC. In Markov chain monte carlo in practice. Gilks W. R., Richardson S. and Spiegelhalter D. J., (eds.), London, Chapman & Hall, pp. 89–114.Google Scholar
- Lampinen J. 2001. A bibliography of Differential Evolution algorithm. Lappeenranta University of Technology, Lappeenranta, http://www.lut.fi/jlampine/debiblio.htm.
- Lampinen J. and Zelinka I. 2000. On stagnation of the Differential Evolution algorithm. Proceedings of MENDEL 2000, 6th International Mendel Conference on Soft Computing, Brno, pp. 76–83.Google Scholar
- Mengersen K. and Robert C. P. 2003. IID sampling using self-avoiding population Monte Carlo: the pinball sampler. In Bernardo J. M., Bayarri M. J., Berger J. O., Dawid A. P., Heckerman D., Smith A. F. M. and West M. (eds.), Bayesian Statistics 7, Oxford, Clarendon Press, pp. 277–292.Google Scholar
- Pinheiro J. C. and Bates D. M. 2000. Mixed-Effects Models in S and S-PLUS. New York, Springer Verlag.Google Scholar
- Price K. 1999. An introduction to differential evolution. In Corne D., Dorigo M. and Glover F. (eds.), New Ideas in Optimization, London, McGraw-Hill, pp. 79–108.Google Scholar
- Price K. and Storn R. 1997. Differential Evolution. Dr Dobb’s Journal 264: 18–24.Google Scholar
- R Development Core Team 2003. R: A language and environment for statistical computing. Vienna, Austria, R Foundation for Statistical Computing. http://www.r-project.org.
- Robert C. P. and Casella G. 2004. Monte Carlo Statistical Methods, 2nd ed., New York, Springer Verlag.Google Scholar
- Spiegelhalter D., Thomas A., Best N., and Lunn D. 2003. WinBUGS User Manual version 1.4. http://www.mrc-bsu.cam.ac.uk/bugs.
- Storn R. and Price K. 1995 Differential Evolution — a simple and efficient adaptive scheme for global optimization over continuous spaces. International Computer Science Institute, Berkeley, TR-95-012, http://www.icsi.berkeley.edu/storn/litera.html.
- Strens M. Bernhardt M. and Everett N. 2002. Markov chain Monte Carlo sampling using direct search optimization. ICML, Sydney, pp. 602–609.Google Scholar
- Waagepetersen R. and Sorensen D. 2001. A tutorial on reversible jump MCMC with a view toward applications in QTL-mapping. International Statistical Review 69: 49–61.Google Scholar