Robust models or sensitivity-analysis models often expand a simpler baseline model by adding a hyperparameter that controls tail behavior or dispersion. Posterior computation for such models can proceed in two ways:

  1. Full Markov chain simulation under the expanded model, often using a mixture representation.
  2. Approximate computation using draws already obtained from the original posterior distribution.

Both approaches aim to obtain inference for the expanded posterior distributionp(θϕ,y)p(θϕ)p(yθ,ϕ),p(\theta \mid \phi, y) \propto p(\theta \mid \phi)\, p(y \mid \theta, \phi),

where θ\theta is the parameter vector from the original model and ϕ\phi is the robustness/sensitivity parameter (for example, the degrees of freedom ν\nu in a tt model).


1. Notation for Robust Models

Let:

  • p0(θy)p_0(\theta \mid y): posterior distribution from the original model (already computed).
  • ϕ\phi: hyperparameter defining the expanded or robust model.
  • Expanded posterior of interest: p(θϕ,y)p(θϕ)p(yθ,ϕ).p(\theta \mid \phi, y) \propto p(\theta \mid \phi)\, p(y \mid \theta, \phi).

The robust component may enter through:

  • Parameter distribution p(θϕ)p(\theta \mid \phi), or
  • Data distribution p(yθ,ϕ)p(y \mid \theta, \phi).

A prior must specify the joint distribution p(θ,ϕ)p(\theta, \phi), since the relationship between θ\theta and ϕ\phi determines how robustness is expressed.


2. Gibbs Sampling via Mixture Representations

Many robust models, including the tt, negative binomial, and beta-binomial, admit a mixture representation involving additional latent scale parameters:

  • For the tν(μ,σ2)t_\nu(\mu, \sigma^2) model, the representation is: yiViN(μ,Vi),ViInv-χ2(ν,σ2).y_i \mid V_i \rightarrow N(\mu, V_i), \qquad V_i \rightarrow \text{Inv-}\chi^2(\nu, \sigma^2).

Sampling proceeds by Gibbs updates for:

  • θ=(μ,σ2)\theta = (\mu, \sigma^2)
  • Latent scales V1,,VnV_1, \dots, V_n

If ν\nu itself is unknown, an additional step must draw from the conditional distribution of ν\nu. This step typically lacks a closed form and requires a Metropolis update.

A complication:

  • Posterior densities under robust models may be multimodal.
  • Each mode often corresponds to a different observation occupying the tail of the distribution.
  • Proper exploration may require strategies such as simulated tempering or careful initialization.

3. Posterior Predictive Simulation for Sensitivity Analysis

To simulate future data y~\tilde{y}​ under a robust model:

  1. Draw θp(θϕ,y)\theta \sim p(\theta \mid \phi, y).
  2. Draw y~p(y~θ,ϕ)\tilde{y} \sim p(\tilde{y} \mid \theta, \phi).

For mixture models:

  • Draw the latent scale first: VInv-χ2(ν,σ2),V \sim \text{Inv-}\chi^2(\nu, \sigma^2),
  • Then simulate: y~N(μ,V).\tilde{y} \sim N(\mu, V).

This two-step structure reflects the model’s long-tailed behavior.


4. Computing the Marginal Posterior of the Robustness Parameter $\phi$ via Importance Weighting

If simulation draws θs\theta^s have already been obtained from the original posterior p0(θy)p_0(\theta \mid y), then the marginal posterior of ϕ\phi can be approximated without running a new MCMC chain.

Using the identity:p(ϕy)p(ϕ)p(θϕ)p(yθ,ϕ)p0(θ)p0(yθ)p0(θy)dθ,p(\phi \mid y) \propto p(\phi) \int \frac{p(\theta \mid \phi)\, p(y \mid \theta, \phi)} {p_0(\theta)\, p_0(y \mid \theta)} \, p_0(\theta \mid y)\, d\theta,

the expression can be approximated by averaging importance ratios:p(ϕy)p(ϕ)1Ss=1Sp(θsϕ)p(yθs,ϕ)p0(θs)p0(yθs).p(\phi \mid y) \approx p(\phi)\, \frac{1}{S} \sum_{s=1}^S \frac{p(\theta^s \mid \phi)\, p(y \mid \theta^s, \phi)} {p_0(\theta^s)\, p_0(y \mid \theta^s)}.

The proportionality constant does not matter when the goal is to compare relative posterior density values across a grid of ϕ\phi.


5. Approximating the Robust Posterior $p(\theta \mid \phi, y)$ via Importance Resampling

When the goal is to approximate the full posterior under a robust model for many values of ϕ\phi, importance resampling avoids running a new MCMC chain for each value.

Procedure:

  1. Begin with a large set of original posterior draws θ1,,θSp0(θy)(S5000).\theta^1, \dots, \theta^S \sim p_0(\theta \mid y) \qquad (S \approx 5000).
  2. For each fixed value of ϕ\phi, compute importance ratios: w(θ)=p(θϕ)p(yθ,ϕ)p0(θ)p0(yθ).w(\theta) = \frac{p(\theta \mid \phi)\, p(y \mid \theta, \phi)} {p_0(\theta)\, p_0(y \mid \theta)}.
  3. Draw a smaller subsample (e.g., k=500k = 500) without replacement,
    with probability proportional to w(θs)w(\theta^s).

This collection is an approximate sample fromp(θϕ,y).p(\theta \mid \phi, y).

A separate subsample must be drawn for each value of ϕ\phi,
but the same original draws can be reused.

Indicators of sensitivity

If importance weights vary wildly:

  • A handful of draws dominate the weighted distribution.
  • Approximation becomes unstable.
  • Sensitivity to ϕ\phi is high.
  • Full MCMC under the robust model becomes necessary.