Access the full text.
Sign up today, get DeepDyve free for 14 days.
N. Radcliffe (1991)
Forma Analysis and Random Respectful Recombination
L. Tierney (1994)
Markov Chains for Exploring Posterior DistributionsAnnals of Statistics, 22
Stephen Brooks (1998)
Markov chain Monte Carlo method and its applicationThe Statistician, 47
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
C. Braak (2004)
Genetic algorithms and Markov Chain Monte Carlo: Differential Evolution Markov Chain makes Bayesian computing easy (revised)
Mădălina Drugan, D. Thierens (2005)
Recombinative EMCMC algorithms2005 IEEE Congress on Evolutionary Computation, 3
W. Gilks, G. Roberts (1995)
Strategies for improving MCMC
C. Braak (2006)
A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spacesStatistics and Computing, 16
L. Bauwens, Charles Bos, H. Dijk, R. Oest (2002)
Adaptive polar sampling, a class of flexibel and robust Monte Carlo integration methods
D. Wolpert, Chiu Lee (2005)
Adaptive Metropolis Sampling and Optimization with Product Distributions
M. Strens, M. Bernhardt, N. Everett (2002)
Markov Chain Monte Carlo Sampling using Direct Search Optimization
M. Seiler, F. Seiler (1989)
Numerical Recipes in C: The Art of Scientific ComputingRisk Analysis, 9
W. Hastings (1970)
Monte Carlo Sampling Methods Using Markov Chains and Their ApplicationsBiometrika, 57
F. Liang, W. Wong (2001)
Real-Parameter Evolutionary Monte Carlo With Applications to Bayesian Mixture ModelsJournal of the American Statistical Association, 96
Mădălina Drugan, D. Thierens (2003)
Evolutionary Markov Chain Monte Carlo
C. Andrieu, Nando Freitas, A. Doucet, Michael Jordan (2004)
An Introduction to MCMC for Machine LearningMachine Learning, 50
P. Green (1996)
Markov chain Monte Carlo in Practice
W. Press (1994)
Numerical recipes in C++: the art of scientific computing, 2nd Edition (C++ ed., print. is corrected to software version 2.10)
K. Deb, Ashish Anand, D. Joshi (2002)
A Computationally Efficient Evolutionary Algorithm for Real-Parameter OptimizationEvolutionary Computation, 10
J. Nelder, R. Mead (1965)
A Simplex Method for Function MinimizationComput. J., 7
D. MacKay (2004)
Information Theory, Inference, and Learning AlgorithmsIEEE Transactions on Information Theory, 50
R. Storn, K. Price (1997)
Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 11
Radford Neal (1995)
Bayesian learning for neural networks
C. Braak (2004)
Genetic algorithms and Markov Chain Monte Carlo: Differential Evolution Markov Chain makes Bayesian computing easy
G. Roberts, A. Gelman, W. Gilks (1997)
Weak convergence and optimal scaling of random walk Metropolis algorithmsAnnals of Applied Probability, 7
W. Press (1989)
Book-Review - Numerical Recipes in Pascal - the Art of Scientific ComputingScience
Markov chain Monte Carlo (MCMC) algorithms are sampling methods for intractable distributions. In this paper, we propose and investigate algorithms that improve the sampling process from multi-dimensional real-coded spaces. We present MCMC algorithms that run a population of samples and apply recombination operators in order to exchange useful information and preserve commonalities in highly probable individual states. We call this class of algorithms Evolutionary MCMCs (EMCMCs). We introduce and analyze various recombination operators which generate new samples by use of linear transformations, for instance, by translation or rotation. These recombination methods discover specific structures in the search space and adapt the population samples to the proposal distribution. We investigate how to integrate recombination in the MCMC framework to sample from a desired distribution. The recombination operators generate individuals with a computational effort that scales linearly in the number of dimensions and the number of parents. We present results from experiments conducted on a mixture of multivariate normal distributions. These results show that the recombinative EMCMCs outperform the standard MCMCs for target distributions that have a nontrivial structural relationship between the dimensions.
Evolutionary Computation – MIT Press
Published: Jun 1, 2010
Keywords: Markov chain Monte Carlo; sampling; evolutionary Markov chain Monte Carlo; simplex recombinations; linear transformations; real-coded search spaces
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.