Diffusion limits of the random walk Metropolis algorithm in high dimensions

From MaRDI portal
Publication:433896


DOI10.1214/10-AAP754zbMath1254.60081arXiv1003.4306MaRDI QIDQ433896

Natesh S. Pillai, Andrew M. Stuart, Jonathan C. Mattingly

Publication date: 8 July 2012

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4306


60J22: Computational methods in Markov chains

60F05: Central limit and other weak theorems

65C05: Monte Carlo methods

60J05: Discrete-time Markov processes on general state spaces

65C40: Numerical analysis or methods applied to Markov chains

60H15: Stochastic partial differential equations (aspects of stochastic analysis)


Related Items

A Hybrid Adaptive MCMC Algorithm in Function Spaces, An Adaptive Independence Sampler MCMC Algorithm for Bayesian Inferences of Functions, Bayesian Inference Using Intermediate Distribution Based on Coarse Multiscale Model for Time Fractional Diffusion Equations, Unnamed Item, Interacting Langevin Diffusions: Gradient Structure and Ensemble Kalman Sampler, Scalable Optimization-Based Sampling on Function Space, A Bayesian Approach to Estimating Background Flows from a Passive Scalar, Asymptotic variance for random walk Metropolis chains in high dimensions: logarithmic growth via the Poisson equation, Bayesian Inverse Problems with $l_1$ Priors: A Randomize-Then-Optimize Approach, A function space HMC algorithm with second order Langevin diffusion limit, MCMC methods for functions: modifying old algorithms to make them faster, Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors, Certified Dimension Reduction for Bayesian Updating with the Cross-Entropy Method, A hierarchical Bayesian approach for modeling the evolution of the 7-day moving average of the number of deaths by COVID-19, Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior, Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions, Noisy gradient flow from a random walk in Hilbert space, On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference, Asymptotic analysis of the random walk metropolis algorithm on ridged densities, Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs, A Dirichlet form approach to MCMC optimal scaling, Explicit contraction rates for a class of degenerate and infinite-dimensional diffusions, Multimodal, high-dimensional, model-based, Bayesian inverse problems with applications in biomechanics, Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions, Weak convergence and optimal tuning of the reversible jump algorithm, Efficiency of delayed-acceptance random walk metropolis algorithms, Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates, Optimal scaling of the MALA algorithm with irreversible proposals for Gaussian targets, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Hierarchical models and tuning of random walk Metropolis algorithms, Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions, Non-stationary phase of the MALA algorithm, Diffusion limit for the random walk Metropolis algorithm out of stationarity, Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit, Dimension-independent likelihood-informed MCMC, Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction, Optimal tuning of the hybrid Monte Carlo algorithm, Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions, On the stability of sequential Monte Carlo methods in high dimensions, Scaling analysis of delayed rejection MCMC methods, Langevin type limiting processes for adaptive MCMC, Accelerated Dimension-Independent Adaptive Metropolis, On the empirical efficiency of local MCMC algorithms with pools of proposals, Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors



Cites Work