Griddy-Gibbs Sampler

griddy-gibbsgibbs-samplermcmcnumerical-integrationbayesiangarchcomputational-statistics

Definition

The griddy-Gibbs sampler is a variant of the Gibbs sampler for cases where the full conditional posterior densities are known only up to a constant and cannot be sampled directly. Instead of drawing from a closed-form conditional, it evaluates each univariate full conditional on a grid of points, numerically integrates it to obtain the (approximate) cumulative distribution function, and inverts that CDF at a uniform draw. Introduced by Ritter and Tanner (1992) and applied to GARCH models by Bauwens and Lubrano (1998).

Key Ideas

How It Works

Cycle over coordinates i=1,,pi=1,\dots,p. For coordinate ii given the current values of the others:

  1. Choose a grid over a range covering the effective support of θiθi,y\theta_i \mid \theta_{-i}, y.
  2. Evaluate the unnormalized conditional k()k(\cdot) at each grid point.
  3. Numerically integrate to form the approximate CDF Φi\Phi_i and normalize.
  4. Draw uUniform(0,1)u\sim\text{Uniform}(0,1) and set θi=Φi1(u)\theta_i = \Phi_i^{-1}(u) by interpolation.

Repeat to obtain a Markov chain whose stationary distribution is the joint posterior. Grid ranges are typically adapted from pilot runs or set generously and refined.

Why It Matters

Open Questions

Related