Adaptively scaling the Metropolis algorithm using expected squared jumped distance

MaRDI QIDQ3405572zbMATH OpenFDO

Authors Cristian Pasarica, Andrew Gelman

Publication date 10 February 2010

Full work available at URL http://www3.stat.sinica.edu.tw/statistica/J20N1/J20N113/J20N113.html

zbMATH Keywords

acceptance ratesBayesian computationiterative simulationMarkov chain Monte Carlomultiple importance sampling

Mathematics Subject Classification ID

Bayesian inference (62F15) Numerical analysis or methods applied to Markov chains (65C40)

Recommendations

• An adaptive Metropolis algorithm
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Optimal proposal distributions and adaptive MCMC
• On adaptive Metropolis-Hastings methods
• On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution

Cited in

(26)

• Asymptotic analysis of the random walk metropolis algorithm on ridged densities
• Adaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter
• Designing simple and efficient Markov chain Monte Carlo proposal kernels
• A Bayesian hierarchical model for spatial extremes with multiple durations
• Efficiency of delayed-acceptance random walk metropolis algorithms
• Accelerating sequential Monte Carlo with surrogate likelihoods
• Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
• Optimal scaling of random-walk Metropolis algorithms on general target distributions
• A multiple-try Metropolis-Hastings algorithm with tailored proposals
• On the efficiency of pseudo-marginal random walk Metropolis algorithms
• Estimation of realized stochastic volatility models using Hamiltonian Monte Carlo-based methods
• An efficient proposal distribution for Metropolis-Hastings using a \(B\)-splines technique
• Optimal tuning of the hybrid Monte Carlo algorithm
• Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
• On the empirical efficiency of local MCMC algorithms with pools of proposals
• Optimal scaling of Metropolis algorithms: Heading toward general target distributions
• Maximum Conditional Entropy Hamiltonian Monte Carlo Sampler
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• An extended sparse max-linear moving model with application to high-frequency financial data
• Automatically adapting the number of state particles in \(\text{SMC}^2\)
• Adaptive tuning of Hamiltonian Monte Carlo within sequential Monte Carlo
• Emerging directions in Bayesian computation
• Unbiased and consistent nested sampling via sequential Monte Carlo
• Sampling by divergence minimization
• Auxiliary MCMC samplers for parallelisable inference in high-dimensional latent dynamical systems
• Graph-accelerated Markov chain Monte Carlo using approximate samples

This page was built for publication: Adaptively scaling the Metropolis algorithm using expected squared jumped distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405572)