On the stability and ergodicity of adaptive scaling Metropolis algorithms
From MaRDI portal
(Redirected from Publication:645599)
Abstract: The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Recommendations
- On adaptive Markov chain Monte Carlo algorithms
- Adaptive optimal scaling of Metropolis-Hastings algorithms using the Robbins-Monro process
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
Cites work
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 1350773 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- Adaptive Markov Chain Monte Carlo through Regeneration
- An adaptive Metropolis algorithm
- Can the adaptive Metropolis algorithm collapse without the covariance lower bound?
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- General state space Markov chains and MCMC algorithms
- Geometric ergodicity of Metropolis algorithms
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- MC's for MCMC'ists
- On adaptive Markov chain Monte Carlo algorithms
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- On the ergodicity properties of some adaptive MCMC algorithms
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- Stability of Stochastic Approximation under Verifiable Conditions
- Trace bounds on the solution of the algebraic matrix Riccati and Lyapunov equation
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(15)- Adaptive optimal scaling of Metropolis-Hastings algorithms using the Robbins-Monro process
- On the stability of some controlled Markov chains and its applications to stochastic approximation with Markovian dynamic
- Adaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter
- An adaptive multiple-try Metropolis algorithm
- Grapham: graphical models with adaptive random walk Metropolis algorithms
- Adaptive Gibbs samplers and related MCMC methods
- Robust adaptive Metropolis algorithm with coerced acceptance rate
- Conditional particle filters with diffuse initial distributions
- A framework for adaptive MCMC targeting multimodal distributions
- Markovian stochastic approximation with expanding projections
- Accelerating adaptation in the adaptive Metropolis–Hastings random walk algorithm
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Can the adaptive Metropolis algorithm collapse without the covariance lower bound?
- On adaptive Markov chain Monte Carlo algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
This page was built for publication: On the stability and ergodicity of adaptive scaling Metropolis algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645599)
