Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions
arXiv:0908.0865 · doi:10.1214/08-AAP563
Abstract
We investigate local MCMC algorithms, namely the random-walk Metropolis and the Langevin algorithms, and identify the optimal choice of the local step-size as a function of the dimension of the state space, asymptotically as . We consider target distributions defined as a change of measure from a product law. Such structures arise, for instance, in inverse problems or Bayesian contexts when a product prior is combined with the likelihood. We state analytical results on the asymptotic behavior of the algorithms under general conditions on the change of measure. Our theory is motivated by applications on conditioned diffusion processes and inverse problems related to the 2D Navier--Stokes equation.
arXiv commentPublished in at http://dx.doi.org/10.1214/08-AAP563 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (4)
Cited by in corpus (35)
- A Survey of Monte Carlo Methods for Parameter Estimation
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- A Survey of Stochastic Simulation and Optimization Methods in Signal Processing
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- A TV-Gaussian prior for infinite-dimensional Bayesian inverse problems and its numerical implementations
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: The longtime behavior
- A computational framework for infinite-dimensional Bayesian inverse problems. Part I: The linearized case, with application to global seismic inversion
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Convergence of unadjusted Hamiltonian Monte Carlo for mean-field models
- Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit
- On the Stability of Sequential Monte Carlo Methods in High Dimensions
- Bayesian computation: a perspective on the current state, and sampling backwards and forwards
- Accelerated dimension-independent adaptive Metropolis
- Methodological reconstruction of historical seismic events from anecdotal accounts of destructive tsunamis: a case study for the great 1852 Banda arc mega-thrust earthquake and tsunami
- Optimal tuning of the Hybrid Monte-Carlo Algorithm
- Weak Convergence and Optimal Tuning of the Reversible Jump Algorithm
- Optimal Scaling of Random-Walk Metropolis Algorithms on General Target Distributions
- An adaptive independence sampler MCMC algorithm for infinite dimensional Bayesian inferences
- Self-Tuning Hamiltonian Monte Carlo for Accelerated Sampling
- Uncertainty quantification in graph-based classification of high dimensional data
- Uncertainty for calculating transport on Titan: a probabilistic description of bimolecular diffusion parameters
- On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inferences
- Optimal scaling of the Random Walk Metropolis algorithm under Lp mean differentiability
- Scaling Up Bayesian Uncertainty Quantification for Inverse Problems using Deep Neural Networks
- Efficiency and computability of MCMC with Langevin, Hamiltonian, and other matrix-splitting proposals
- MALA-within-Gibbs samplers for high-dimensional distributions with sparse conditional structure
- Algorithms for Kullback-Leibler Approximation of Probability Measures in Infinite Dimensions
- Sequential Monte Carlo Methods for Bayesian Elliptic Inverse Problems
- On Metropolis Integrators for Molecular Dynamics
- Adaptive Sequential MCMC for Combined State and Parameter Estimation
- Localization for MCMC: sampling high-dimensional posterior distributions with local structure
- Anytime Parallel Tempering
- Metropolis-Hastings algorithms with autoregressive proposals, and a few examples