Analysis of Multiple-try Metropolis via Poincaré inequalities
From MaRDI portal
Cites work
- Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC
- Convergence rate of multiple-try Metropolis independent sampler
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Equation of state calculations by fast computing machines
- Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Hit-and-run mixes fast
- scientific article; zbMATH DE number 1082719 (Why is no real title available?)
- scientific article; zbMATH DE number 5019925 (Why is no real title available?)
- Informed proposals for local MCMC in discrete spaces
- Interacting multiple try algorithms with different proposal distributions
- Issues in the multiple try Metropolis mixing
- Monte Carlo sampling methods using Markov chains and their applications
- On the fundamental limitations of multi-proposal Markov chain Monte Carlo algorithms
- Scaling analysis of multiple-try MCMC methods
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- The use of a single pseudo-sample in approximate Bayesian computation
- Weak convergence and optimal scaling of random walk Metropolis algorithms
This page was built for publication: Analysis of Multiple-try Metropolis via Poincaré inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842109)