A Dirichlet form approach to MCMC optimal scaling
DOI10.1016/j.spa.2017.03.021zbMath1374.60030arXiv1606.01528OpenAlexW2963732738MaRDI QIDQ1679476
Giacomo Zanella, Mylène Bédard, Wilfrid S. Kendall
Publication date: 9 November 2017
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01528
weak convergenceMosco convergenceDirichlet formMarkov chain Monte Carlo (MCMC)scaling limitsoptimal scalinginfinite-dimensional stochastic processesasymptotic analysis for MCMCMetropolis-Hastings random walk sampler
Computational methods in Markov chains (60J22) Central limit and other weak theorems (60F05) Monte Carlo methods (65C05)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
- Scaling analysis of multiple-try MCMC methods
- Mosco convergence of Dirichlet forms in infinite dimensions with changing reference measures
- Optimal scaling for partially updating MCMC algorithms
- Classical Dirichlet forms on topological vector spaces - the construction of the associated diffusion process
- Introduction to the theory of (non-symmetric) Dirichlet forms
- Composite media and asymptotic Dirichlet forms
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Weak convergence of Dirichlet processes
- From Metropolis to diffusions: Gibbs states and optimal scaling.
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
- Handbook of Markov Chain Monte Carlo
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
This page was built for publication: A Dirichlet form approach to MCMC optimal scaling