Weak convergence and optimal scaling of random walk Metropolis algorithms
Reads0
Chats0
TLDR
In this paper, the authors consider scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in order to maximize the efficiency of the algorithm and obtain a weak convergence result as the dimension of a sequence of target densities, n, converges to $\infty$.Abstract:
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of target densities, n, converges to $\infty$. When the proposal variance is appropriately scaled according to n, the sequence of stochastic processes formed by the first component of each Markov chain converges to the appropriate limiting Langevin diffusion process. The limiting diffusion approximation admits a straightforward efficiency maximization problem, and the resulting asymptotically optimal policy is related to the asymptotic acceptance rate of proposed moves for the algorithm. The asymptotically optimal acceptance rate is 0.234 under quite general conditions. The main result is proved in the case where the target density has a symmetric product form. Extensions of the result are discussed.read more
Citations
More filters
Journal ArticleDOI
Understanding the Metropolis-Hastings Algorithm
Siddhartha Chib,Edward Greenberg +1 more
TL;DR: A detailed, introductory exposition of the Metropolis-Hastings algorithm, a powerful Markov chain method to simulate multivariate distributions, and a simple, intuitive derivation of this method is given along with guidance on implementation.
Journal ArticleDOI
An adaptive Metropolis algorithm
TL;DR: An adaptive Metropolis (AM) algorithm, where the Gaussian proposal distribution is updated along the process using the full information cumulated so far, which establishes here that it has the correct ergodic properties.
BookDOI
MCMC using Hamiltonian dynamics
TL;DR: In this paper, the authors discuss theoretical and practical aspects of Hamiltonian Monte Carlo, and present some of its variations, including using windows of states for deciding on acceptance or rejection, computing trajectories using fast approximations, tempering during the course of a trajectory to handle isolated modes, and short-cut methods that prevent useless trajectories from taking much computation time.
Journal ArticleDOI
The BUGS project: Evolution, critique and future directions
TL;DR: A balanced critical appraisal of the BUGS software is provided, highlighting how various ideas have led to unprecedented flexibility while at the same time producing negative side effects.
Journal ArticleDOI
Inverse problems: A Bayesian perspective
TL;DR: The Bayesian approach to regularization is reviewed, developing a function space viewpoint on the subject, which allows for a full characterization of all possible solutions, and their relative probabilities, whilst simultaneously forcing significant modelling issues to be addressed in a clear and precise fashion.
References
More filters
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Book
Markov Processes: Characterization and Convergence
TL;DR: In this paper, the authors present a flowchart of generator and Markov Processes, and show that the flowchart can be viewed as a branching process of a generator.
Journal ArticleDOI
Bayesian Computation and Stochastic Systems
TL;DR: Basic methodology of MCMC is presented, emphasizing the Bayesian paradigm, conditional probability and the intimate relationship with Markov random fields in spatial statistics, and particular emphasis on the calculation of posterior probabilities.
Journal ArticleDOI
Rates of convergence of the Hastings and Metropolis algorithms
TL;DR: Recent results in Markov chain theory are applied to Hastings and Metropolis algorithms with either independent or symmetric candidate distributions, and it is shown geometric convergence essentially occurs if and only if $pi$ has geometric tails.