## Barker at the Bernoulli factory

**Y**esterday, Flavio Gonçalves, Krzysztof Latuszýnski, and Gareth Roberts (Warwick) arXived a paper on Barker’s algorithm for Bayesian inference with intractable likelihoods.

“…roughly speaking Barker’s method is at worst half as good as Metropolis-Hastings.”

Barker’s acceptance probability (1965) is a smooth if less efficient version of Metropolis-Hastings. (Barker wrote his thesis in Adelaide, in the Mathematical Physics department. Most likely, he never interacted with Ronald Fisher, who died there in 1962) This smoothness is exploited by devising a Bernoulli factory consisting in a 2-coin algorithm that manages to simulate the Bernoulli variable associated with the Barker probability, from a coin that can simulate Bernoulli’s with probabilities proportional to [bounded] π(θ). For instance, using a bounded unbiased estimator of the target. And another coin that simulates another Bernoulli on a remainder term. Assuming the bound on the estimate of π(θ) is known [or part of the remainder term]. This is a neat result in that it expands the range of pseudo-marginal methods (and resuscitates Barker’s formula from oblivion!). The paper includes an illustration in the case of the far-from-toyish Wright-Fisher diffusion. [Making Fisher and Barker meeting, in the end!]

*Related*

This entry was posted on October 5, 2017 at 12:17 am and is filed under Books, Statistics with tags Barker's algorithm, Bernoulli factory, Metropolis-Hastings algorithm, pseudo-marginal MCMC, Ronald Fisher, University of Adelaide, University of Warwick, Wright-Fisher model. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

This site uses Akismet to reduce spam. Learn how your comment data is processed.

## Leave a Reply