Publication 2026
Almost sure convergence rates of adaptive increasingly rare Markov chain Monte Carlo
Stochastic Processes and their Applications · with K. Łatuszyński, G. O. Roberts & D. Rudolf
Establishes almost-sure convergence rates for adaptive increasingly rare MCMC — theoretical guarantees for a class of adaptive sampling algorithms used wherever MCMC is applied. Of relevance to any user of adaptive MCMC: the results certify that the sampler converges, and how fast.
- › Preprint at arXiv:2402.12122.
- › Follow-up preprint “Error bounds for simultaneous Wasserstein contractive adaptive increasingly rare MCMC” (with D. Rudolf, Jun 2026) extends the theory to error bounds — arXiv:2606.30018.
- › Presented at the Austrian Stochastics Days 2025 (Sep 2025).
Linked · DOI Adaptive MCMC Convergence rates