Convergence rate of multiple-try Metropolis independent sampler
From MaRDI portal
Publication:6173559
DOI10.1007/s11222-023-10241-3zbMath1517.62050arXiv2111.15084OpenAlexW4381845952MaRDI QIDQ6173559
No author found.
Publication date: 21 July 2023
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.15084
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interacting multiple try algorithms with different proposal distributions
- Scaling analysis of multiple-try MCMC methods
- Gibbs sampling, exponential families and orthogonal polynomials
- What do we know about the Metropolis algorithm?
- On parallelizable Markov chain Monte Carlo algorithms with waste-recycling
- Markov chains for exploring posterior distributions. (With discussion)
- Monte Carlo strategies in scientific computing.
- Handbook of Markov Chain Monte Carlo
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Weighted finite population sampling to maximize entropy
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Equation of State Calculations by Fast Computing Machines
- On the geometric ergodicity of Metropolis-Hastings algorithms
- Monte Carlo sampling methods using Markov chains and their applications
- Monte Carlo Approximation of Bayes Factors via Mixing With Surrogate Distributions
- Multipoint Metropolis method with application to hybrid Monte Carlo
