On‐line partitioning of the sample space in the regional adaptive algorithm

DOI10.1002/cjs.11562OpenAlexW3045573207MaRDI QIDQ6059502

Unnamed Author, Mylène Bédard

Publication date: 2 November 2023

Published in: Canadian Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cjs.11562

zbMATH Keywords

Markov chain Monte CarloergodicityMahalanobis distancebimodal distributionadaptive sampler

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

An adaptive multiple-try Metropolis algorithm

Cites Work

• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors
• On adaptive Markov chain Monte Carlo algorithms
• On the ergodicity properties of some adaptive MCMC algorithms
• Optimal scaling for various Metropolis-Hastings algorithms.
• Inference from iterative simulation using multiple sequences
• Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing
• Componentwise adaptation for high dimensional MCMC
• Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection
• Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC
• Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
• Equation of State Calculations by Fast Computing Machines
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• Monte Carlo sampling methods using Markov chains and their applications
• An adaptive Metropolis algorithm