On Russian Roulette Estimates for Bayesian Inference with Doubly-Intractable Likelihoods
Anne-Marie Lyne, Mark Girolami, Yves Atchad\'e, Heiko Strathmann,, Daniel Simpson

TL;DR
This paper explores advanced Bayesian inference techniques for doubly-intractable models, introducing a novel likelihood estimation method using Russian Roulette sampling and pseudo-marginal MCMC, with applications to complex statistical models.
Contribution
It presents a new unbiased likelihood estimation approach based on infinite series and Russian Roulette sampling, applicable to a broad class of doubly-intractable models.
Findings
Demonstrates the method on Ising models and Gaussian Markov Random Fields
Shows the potential of negative likelihood estimates in pseudo-marginal MCMC
Provides a critical assessment of the method's strengths and limitations
Abstract
A large number of statistical models are "doubly-intractable": the likelihood normalising term, which is a function of the model parameters, is intractable, as well as the marginal likelihood (model evidence). This means that standard inference techniques to sample from the posterior, such as Markov chain Monte Carlo (MCMC), cannot be used. Examples include, but are not confined to, massive Gaussian Markov random fields, autologistic models and Exponential random graph models. A number of approximate schemes based on MCMC techniques, Approximate Bayesian computation (ABC) or analytic approximations to the posterior have been suggested, and these are reviewed here. Exact MCMC schemes, which can be applied to a subset of doubly-intractable distributions, have also been developed and are described in this paper. As yet, no general method exists which can be applied to all classes of models…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
