Canadian Journal of Statistics · 2008 · 63 citations · 21 references
ComputingComputer ScienceMathematicsMarkov Decision ProcessesOptimizationScientific ComputingBayesian ComputationGaussian ProcessesMarkov Chain Monte CarloMonte Carlo MethodsMonte Carlo SimulationMetropolis AlgorithmMetropolis-hastings AlgorithmMetropolis-hastings SamplingOptimal ScalingProposal Distribution
Abstract The authors provide an overview of optimal scaling results for the Metropolis algorithm with Gaussian proposal distribution. They address in more depth the case of high‐dimensional target distributions formed of independent, but not identically distributed components. They attempt to give an intuitive explanation as to why the well‐known optimal acceptance rate of 0.234 is not always suitable. They show how to find the asymptotically optimal acceptance rate when needed, and they explain why it is sometimes necessary to turn to inhomogeneous proposal distributions. Their results are illustrated with a simple example.
21
Equation of State Calculations by Fast Computing Machines
N. Metropolis, Arianna W. Rosenbluth, M. N. Rosenbluth et al. · The Journal of Chemical Physics · 1953 · 37.1K citations
Monte Carlo sampling methods using Markov chains and their applications
W. Keith Hastings · Biometrika · 1970 · 15.2K citations
Markov Processes: Characterization and Convergence.
Andris Abakuks, S. N. Ethier, Thomas G. Kurtz · Biometrics · 1987 · 4.5K citations