An adaptive multiple-try Metropolis algorithm
DOI10.3150/21-BEJ1408OpenAlexW4224309854MaRDI QIDQ2137054FDOQ2137054
Authors: Simon Fontaine, M. Bédard
Publication date: 16 May 2022
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/journals/bernoulli/volume-28/issue-3/An-adaptive-multiple-try-Metropolis-algorithm/10.3150/21-BEJ1408.full
ergodicitylimit theoremmultiple candidatesadaptive scalingloss of heterozygosityrandom walk samplerrobust adaptation
Computational methods for problems pertaining to statistics (62-08) Probabilistic methods, stochastic differential equations (65Cxx) Limit theorems in probability theory (60Fxx) Markov processes (60Jxx)
Cites Work
- Robust adaptive Metropolis algorithm with coerced acceptance rate
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Markov chains for exploring posterior distributions. (With discussion)
- Markov Chains and Stochastic Stability
- Title not available (Why is that?)
- Multivariate output analysis for Markov chain Monte Carlo
- An adaptive Metropolis algorithm
- Monte Carlo sampling methods using Markov chains and their applications
- A Stochastic Approximation Method
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Equation of state calculations by fast computing machines
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- On the stability and ergodicity of adaptive scaling Metropolis algorithms
- On adaptive Markov chain Monte Carlo algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- The random walk Metropolis: linking theory and practice through a case study
- Optimal tuning of the hybrid Monte Carlo algorithm
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
- On the flexibility of the design of multiple try Metropolis schemes
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Interacting multiple try algorithms with different proposal distributions
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- From Metropolis to diffusions: Gibbs states and optimal scaling.
- Optimal scaling of MaLa for nonlinear regression.
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- Optimal scaling of Metropolis algorithms: Heading toward general target distributions
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Scaling analysis of delayed rejection MCMC methods
- Scaling analysis of multiple-try MCMC methods
- Ergodicity of combocontinuous adaptive MCMC algorithms
- Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
- Adaptive Component-Wise Multiple-Try Metropolis Sampling
- Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
- On‐line partitioning of the sample space in the regional adaptive algorithm
Cited In (7)
- Plateau proposal distributions for adaptive component-wise multiple-try metropolis
- Issues in the multiple try Metropolis mixing
- An adaptive Metropolis algorithm
- A Repelling–Attracting Metropolis Algorithm for Multimodality
- A novel method for damage identification based on tuning-free strategy and simple population Metropolis-Hastings algorithm
- A multi-point Metropolis scheme with generic weight functions
- Adaptive Component-Wise Multiple-Try Metropolis Sampling
Uses Software
This page was built for publication: An adaptive multiple-try Metropolis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2137054)