Pseudo-marginal Metropolis–Hastings algorithm explained

In computational statistics, the pseudo-marginal Metropolis–Hastings algorithm^[1] is a Monte Carlo method to sample from a probability distribution. It is an instance of the popular Metropolis–Hastings algorithm that extends its use to cases where the target density is not available analytically. It relies on the fact that the Metropolis–Hastings algorithm can still sample from the correct target distribution if the target density in the acceptance ratio is replaced by an estimate. It is especially popular in Bayesian statistics, where it is applied if the likelihood function is not tractable (see example below).

Algorithm description

\pi(\theta) . The algorithm follows the same steps as the standard Metropolis–Hastings algorithm except that the evaluation of the target density is replaced by a non-negative and unbiased estimate. For comparison, the main steps of a Metropolis–Hastings algorithm are outlined below.

Metropolis–Hastings algorithm

See also: Metropolis–Hastings algorithm.

Given a current state

\theta _{n} the Metropolis–Hastings algorithm proposes a new state according to some density \theta'\sim Q( ⋅ \mid \theta _{n)} . The algorithm then sets \theta _{n+1} = \theta' with probabilitya(\theta _{n,} \theta') =min \left( 1 , (\pi(\theta'))/(\pi(\theta _{n)}) (Q(\theta _{n\mid\theta')})/(Q(\theta'\mid\theta _{n)}) \right)

otherwise the old state is kept, that is,

\theta _{n+1} = \theta _{n} .

Pseudo-marginal Metropolis–Hastings algorithm

If the density

\pi is not available analytically the above algorithm cannot be employed. The pseudo-marginal Metropolis–Hastings algorithm in contrast only assumes the existence of an unbiased estimator \hat{\pi} _{\theta} , i.e. the estimator must satisfy the equation E [\hat{\pi} _{\theta]} = \pi(\theta). Now, given \theta _{n} and the respective estimate \hat{\pi} _{\theta _{n}} the algorithm proposes a new state according to some density \theta'\sim Q( ⋅ \mid \theta _{n)} . Next, compute an estimate \hat{\pi} _{\theta'} and set \theta _{n+1} = \theta' with probabilitya(\theta _{n,} \theta') = min \left( 1 , (\hat{\pi)/(_{\theta'}) } \frac\right)

otherwise the old state is kept, that is,

\theta _{n+1} = \theta _{n} .

Application to Bayesian statistics

In Bayesian statistics the target of inference is the posterior distribution

p(\theta \mid y) = (p _{\theta(y)p(\theta)})/(p(y)) ,

where

p _{\theta} denotes the likelihood function, p is the prior and p(y) is the prior predictive distribution.Since there is often no analytic expression of this quantity, one often relies on Monte Carlo methods to sample from the distribution instead. Monte Carlo methods often need the likelihood p _{\theta(y)} to be accessible for every parameter value \theta . In some cases, however, the likelihood does not have an analytic expression. An example of such a case is outlined below.

Example: Latent variable model

Consider a model consisting of i.i.d. latent real-valued random variables

Z _{1,\ldots,Z} _{n} with Z _{i} \sim f _{\theta( ⋅ )} and suppose one can only observe these variables through some additional noise Y _{i} \mid Z _{i} = z \sim g _{\theta( ⋅ \mid} z) for some conditional density g . (This could be due to measurement error, for instance.) We are interested in Bayesian analysis of this model based on some observed data y _{1,} \ldots, y _{n} . Therefore, we introduce some prior distribution p(\theta) on the parameter. In order to compute the posterior distributionp(\theta \mid y _{1,} \ldots, y _{n)} \propto p _{\theta(y} _{1,} \ldots, y _{n)} p(\theta)

we need to find the likelihood function

p _{\theta(y} _{1,} \ldots, y _{n)} . The likelihood contribution of any observed data point y is thenp _{\theta(y)} = \int g _{\theta(y} \mid z)f _{\theta(z)} dz

and the joint likelihood of the observed data

y _{1,} \ldots, y _{n} isp _{\theta(y} _{1,} \ldots, y _{n)} = \prod ^{n} _{i =1} p _{\theta(y} _{i)} = \prod ^{n} _{i =1} \int g _{\theta(y} _{i} \mid z _{i)f} _{\theta(z} _{i)} dz _{i.}

If the integral on the right-hand side is not analytically available, importance sampling can be used to estimate the likelihood. Introduce an auxiliary distribution

q such that g _{\theta(y\mid} z)f _{\theta(z)} > 0 ⇒ q(z) > 0 for all z then\hat{p} _{\theta(y} ^{i) = (1)/(N)} \sum ^{N} _{k =1} (g _{\theta(y} _{i} \mid Z _{k)f} _{\theta(Z} _{k)})/(q(Z _{k)}) , Z _{k} \overset{i.i.d.}{\sim} q( ⋅ )

is an unbiased estimator of

p _{\theta(y} _{i)} and the joint likelihood can be estimated unbiasedly by\hat{p} _{\theta(y} _{1,} \ldots, y _{n)} = \prod ^{n} _{i =1} \hat{p} _{\theta(y} _{i)} = \prod ^{n} _{i =1} (1)/(N) \sum ^{N} _{k =1} (g _{\theta(y} _{i} \mid Z _{i,k} ) f _{\theta(Z} _{i,k} ))/(q(Z _{i,k} )) , Z _{i,k} \overset{i.i.d.}{\sim} q( ⋅ ).

Extensions

Pseudo-marginal Metropolis-Hastings can be seen as a special case of so-called particle marginal Metropolis-Hastings algorithms. In the case of the latter, unbiased estimators of densities relating to static parameters in state-space models may be obtained using a particle filter. While the algorithm enables inference on both the joint space of static parameters and latent variables, when interest is only in the static parameters the algorithm is equivalent to a pseudo-marginal algorithm.^[2]

Notes and References

1. Andrieu. Christophe. Roberts. Gareth O.. The pseudo-marginal approach for efficient Monte Carlo computations. Annals of Statistics. 2009. 37. 2. 697–725. 10.1214/07-aos574. 0903.5480. Project Euclid. free.
2. 10.1111/j.1467-9868.2009.00736.x . Particle Markov chain Monte Carlo methods . 2010 . Andrieu . Christophe . Doucet . Arnaud . Holenstein . Roman . Journal of the Royal Statistical Society, Series B (Statistical Methodology) . 72 . 3 . 269–342 . 13962777 . free .