Hierarchical models and tuning of random walk Metropolis algorithms
Summary: We obtain weak convergence and optimal scaling results for the random walk Metropolis algorithm with a Gaussian proposal distribution. The sampler is applied to hierarchical target distributions, which form the building block of many Bayesian analyses. The global asymptotically optimal proposal variance derived may be computed as a function of the specific target distribution considered. We also introduce the concept of locally optimal tunings, i.e., tunings that depend on the current position of the Markov chain. The theorems are proved by studying the generator of the first and second components of the algorithm and verifying their convergence to the generator of a modified RWM algorithm and a diffusion process, respectively. The rate at which the algorithm explores its state space is optimized by studying the speed measure of the limiting diffusion process. We illustrate the theory with two examples. Applications of these results on simulated and real data are also presented.
- Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
- An adaptive Metropolis algorithm
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Equation of state calculations by fast computing machines
- Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Langevin diffusions and the Metropolis-adjusted Langevin algorithm
- Monte Carlo sampling methods using Markov chains and their applications
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
- Optimal scaling for partially updating MCMC algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Scaling analysis of multiple-try MCMC methods
- Stochastic Volatility: Likelihood Inference and Comparison with ARCH Models
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs
- Optimal scaling of the independence sampler: theory and practice
- Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- scientific article; zbMATH DE number 2017344 (Why is no real title available?)
- scientific article; zbMATH DE number 2051000 (Why is no real title available?)
- An automatic robust Bayesian approach to principal component regression
- The random walk Metropolis: linking theory and practice through a case study
This page was built for publication: Hierarchical models and tuning of random walk Metropolis algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272872)
