Markov Chain Monte Carlo (MCMC) techniques are a method Bayesian statistics which are used when the prior distribution is not conjugate to the likelihood. Where this is the case it is often not possible to evaluate the posterior density analytically, and so numerical methods must be employed. MCMC methods provide an algorithm which simulate realisations from the posterior distribution. The most well known MCMC techniques are the Gibbs sampler, and Metropolis-Hastings sampling.
The Gibbs sampler requires you to initialise the value of each parameter, . It then simulates each parameter from its conditional distribution, based on past simulations, . After a burn-in period, the Gibbs sampler will converge to the posterior distribution. The Gibbs sampler can only be used if the conditional distributions are standard distributions and so easy to simulate from.
When the conditional distributions are not standard, Metropolis-Hastings can be used. The Metropolis-Hastings algorithm also requires the chain to be initialised. It then generates a proposed value for each parameter from the proposal distribution , and calculates an acceptance probability of the proposal, given by . It then either accepts the proposed value, with probability or sets .
While Metropolis-Hastings does not require you to know the value of the normalising constant of the posterior, it does require that the posterior is able to be evaluated. When this cannot be done, but an approximation can be produced, pseudo-marginal Metropolis-Hastings can be used. The posterior distribution is . When the likelihood, , is not known, the posterior cannot be calculated. However if can be estimated to give which is unbiased and non-negative, then pseudo-marginal MCMC can simulate approximations which have the correct stationary distribution.
The algorithm uses the current value and an estimate . For each timestep,
- Propose from
- Sample from to construct .
- Use Metropolis-Hastings with acceptance probability .
For further information and references, see