<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J.A. Vrugt</style></author><author><style face="normal" font="default" size="100%">ter Braak, C. J. F.</style></author><author><style face="normal" font="default" size="100%">Diks, C. G. H.</style></author><author><style face="normal" font="default" size="100%">Robinson, B. A.</style></author><author><style face="normal" font="default" size="100%">Hyman, J. M.</style></author><author><style face="normal" font="default" size="100%">Higdon, D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Accelerating Markov Chain Monte Carlo Simulation by Differential Evolution with Self-Adaptive Randomized Subspace Sampling</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Nonlinear Sciences and Numerical Simulation</style></secondary-title><alt-title><style face="normal" font="default" size="100%">Int. J. Nonlinear Sci. Numer. Simul.</style></alt-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">1172</style></keyword><keyword><style  face="normal" font="default" size="100%">adaptation</style></keyword><keyword><style  face="normal" font="default" size="100%">bayesian-inference</style></keyword><keyword><style  face="normal" font="default" size="100%">Content Type: Biblio</style></keyword><keyword><style  face="normal" font="default" size="100%">DE-MC,</style></keyword><keyword><style  face="normal" font="default" size="100%">differential evolution Markov chain</style></keyword><keyword><style  face="normal" font="default" size="100%">DRAM, delayed rejection adaptive</style></keyword><keyword><style  face="normal" font="default" size="100%">DREAM, differential evolution adaptive metropolis</style></keyword><keyword><style  face="normal" font="default" size="100%">MCMC, Markov chain Monte Carlo</style></keyword><keyword><style  face="normal" font="default" size="100%">Metropolis</style></keyword><keyword><style  face="normal" font="default" size="100%">metropolis algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">migration</style></keyword><keyword><style  face="normal" font="default" size="100%">models</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">proposal</style></keyword><keyword><style  face="normal" font="default" size="100%">regeneration</style></keyword><keyword><style  face="normal" font="default" size="100%">RWM, random walk metropolis</style></keyword><keyword><style  face="normal" font="default" size="100%">samplers</style></keyword><keyword><style  face="normal" font="default" size="100%">SCE-UA,</style></keyword><keyword><style  face="normal" font="default" size="100%">shuffled complex evolution - university of Arizona</style></keyword><keyword><style  face="normal" font="default" size="100%">uncertainty</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Mar</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">&lt;Go to ISI&gt;://000264593800001</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">273-290</style></pages><isbn><style face="normal" font="default" size="100%">1565-1339</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Markov chain Monte Carlo (MCMC) methods have found widespread use in many fields of study to estimate the average properties of complex systems, and for posterior inference in a Bayesian framework. Existing theory and experiments prove convergence of well-constructed MCMC schemes to the appropriate limiting distribution under a variety of different conditions. In practice, however this convergence is often observed to be disturbingly slow. This is frequently caused by an inappropriate selection of the proposal distribution used to generate trial moves in the Markov Chain. Here we show that significant improvements to the efficiency of MCMC simulation can be made by using a self-adaptive Differential Evolution learning strategy within a population-based evolutionary framework. This scheme, entitled Differential Evolution Adaptive Metropolis or DREAM, runs multiple different chains simultaneously for global exploration, and automatically tunes the scale and orientation of the proposal distribution in randomized subspaces during the search. Ergodicity of the algorithm is proved, and various examples involving nonlinearity, high-dimensionality, and multimodality show that DREAM is generally Superior to other adaptive MCMC sampling approaches. The DREAM scheme significantly enhances the applicability of MCMC simulation to Complex, multi-modal search problems.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Article</style></work-type><accession-num><style face="normal" font="default" size="100%">ISI:000264593800001</style></accession-num><notes><style face="normal" font="default" size="100%">&lt;p&gt;Vrugt, Jasper A. ter Braak, C. J. F. Diks, C. G. H. Robinson, Bruce A. Hyman, James M. Higdon, Dave&lt;/p&gt;</style></notes></record></records></xml>