Asymptotic analysis of the random walk metropolis algorithm on ridged densities
From MaRDI portal
Publication:1617150
DOI10.1214/18-AAP1380MaRDI QIDQ1617150
Alexandros Beskos, Gareth O. Roberts, Natesh S. Pillai, Alexandre H. Thiery
Publication date: 7 November 2018
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.02577
Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Numerical solutions to stochastic differential and integral equations (65C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information-geometric Markov chain Monte Carlo methods using diffusions
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Bayesian inverse problems with Gaussian priors
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of MaLa for nonlinear regression.
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Convergence of posteriors for structurally non-identified problems using results from the theory of inverse problems
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Bayesian inverse problems for functions and applications to fluid mechanics
- Asymptotic Statistics
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
