Exact MCMC for intractable proposals
Japanese Journal of Statistics and Data Science · 27.07.2026
DOI: 10.1007/s42081-026-00367-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Japanese Journal of Statistics and Data Science, online erschienen am 27.07.2026. Verfasst von Dwija Kakkad und 1 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: Google Asia Pacific.
Abstract (Originalsprache)
Accept-reject based Markov chain Monte Carlo (MCMC) methods are the workhorse algorithm for Bayesian inference. These algorithms, like Metropolis-Hastings, require choosing a proposal distribution which is typically informed by the desired target distribution. Surprisingly, proposal distributions with unknown normalizing constants are not uncommon, even though for such a choice of a proposal, the Metropolis-Hastings acceptance ratio cannot be evaluated exactly. Across the literature, authors resort to approximation methods that yield inexact MCMC or develop specialized algorithms to combat this problem. We show how Bernoulli factory MCMC algorithms, originally proposed for doubly intractable target distributions, can quite naturally be adapted to yield an exact MCMC sampling method. We present three diverse and relevant examples demonstrating the usefulness of the Bernoulli factory approach to this problem.
Förderung
- Google Asia Pacific
Zitieren
APA
Kakkad, D., & Vats, D. (2026). Exact MCMC for intractable proposals. Japanese Journal of Statistics and Data Science. https://doi.org/10.1007/s42081-026-00367-9
Vancouver
Kakkad D, Vats D. Exact MCMC for intractable proposals. Japanese Journal of Statistics and Data Science. 2026. doi:10.1007/s42081-026-00367-9
BibTeX
@article{Kakkad2026,
author = {Kakkad, Dwija and Vats, Dootika},
title = {Exact MCMC for intractable proposals},
journal = {Japanese Journal of Statistics and Data Science},
year = {2026},
doi = {10.1007/s42081-026-00367-9}
}
EUVIMED