Robit regression (Liu 2006) replaces the normal cumulative distribution function (CDF) link in probit with a Student-t CDF: Pr(yi=1∣xi,β)=Fν(xi′β), where Fν is the t-CDF with ν degrees of freedom, location zero, and scale one. As ν→∞, robit recovers probit exactly; robit(7) closely approximates the logistic link (max quantile-quantile (Q-Q) deviation 0.0006 with scale σ=1.5484). The key advantage over probit and logistic is bounded influence: the maximum likelihood estimator (MLE) influence function is bounded by ν in absolute value, making the MLE resistant to outlying observations.
Key Ideas
Robustness of MLE: The score factor fν(x′β^)/Fν(x′β^)⋅x′β^ is bounded (approaches −ν as x′β^→−∞, 0 as x′β^→+∞). For logistic, influence is unbounded; for probit, it diverges as (x′β^)2. Bounded influence = no single observation can dominate the MLE.
Scale mixture structure: The complete-data model τi∣θ∼Gamma(ν/2,ν/2), zi∣(τi,θ)∼N(xi′β,1/τi), yi=1[zi>0] marginalizes to the t-link. The Gamma weights τi downweight observations whose latent zi is far from the boundary, enabling outlier identification: small τ^i flags observation i as influential.
Robit(7) ≈ logistic: Scale σ=1.5484 is chosen to minimize the maximum Q-Q distance between F7(x/σ) and Flogistic(x) over the 0.001–0.999 range; the max distance is 0.0006. Robit with 5 or 6 df balances robustness and logistic approximation for practitioners who want both.
EM (known ν): E-step computes τ^i and z^i analytically as ratios of t-CDF tail probabilities; M-step is weighted least squares (WLS) β^=(∑τ^ixixi′)−1(∑τ^ixiz^i).
ECME (Expectation/Conditional Maximization Either; unknown ν): CM-step 1 = WLS for β; CM-step 2 = profile likelihood search over ν by half-interval method on eq. (11).
PX-EM (Parameter-Expanded EM; Liu-Rubin-Wu 1998): Expand model with working parameters (α,σ); compute α^=τˉ and σ^2=n−1(Sτzz−Sτxz′Sτxx−1Sτxz); update β(t+1)=(α^/σ^)β^∗. Converges dramatically faster than EM.
Bayesian data augmentation (DA) algorithms:
Basic DA: Prior β∼tp(0,S0−1,ν0) hierarchically represented via τ0∼Gamma(ν0/2,ν0/2). I-step: draw zi from truncated t(μi,1,ν) (by inversion), τi from Gamma((ν+1)/2,(ν+(zi−μi)2)/2), τ0 from its prior. P-step: draw β∼N(β^,(τ0S0+Sτxx)−1).
E-DA 1: After P-step, rescale β^ by χn/s1/2 where s2=∑τi(zi−xi′β^)2+β^′τ0S0β^. Integrates out the common scale of zi; converges faster than DA.
E-DA 2: Further rescale by (w/χν0+nν2)1/2 where w=∑i=0nνiτi. Integrates out both the z-scale and the τ-scale. Fastest convergence.
Outlier detection: Fitted weights τ^i≪1 identify influential observations. In Finney (1947) vaso-constriction data (n=39), ν^≈0.11 (near-Cauchy, quasi-separation), and observations 4, 18, 24 are flagged — consistent with Pregibon (1982) resistant fits.
How It Works
EM E-Step (Known ν)
τ^i=νν+1⋅Pr(tν<−μi)Pr(tν+2<−1+2/νμi)(yi=0)
with sign flip for yi=1. The pseudo-response is:
z^i=μi+(2yi−1)yi−(2yi−1)Pr(tν+2<−1+2/νμi)fν(μi)
Then M-step: β^=(∑τ^ixixi′)−1(∑τ^ixiz^i).
E-DA 2 Cycle (One Bayesian Iteration)
Draw zi∣β,yi from truncated t(μi,1,ν) by inversion of Fν.
Provides a tractable robust alternative to logistic and probit: t-link with small ν downweights outliers automatically via WLS weights, with no user-set tuning.
PX-EM achieves much faster MLE convergence than basic EM, extending the Liu-Rubin-Wu (1998) framework to binary regression.
Bayesian DA is simpler than Holmes-Held (2006) exact logistic sampler (standard Gamma and truncated-t draws only, no Generalized Inverse Gaussian (GIG) rejection), making it easier to extend to multivariate binary responses.
Fitted weights τ^i are a natural outlier-detection diagnostic, produced as a free by-product of the EM E-step.
Open Questions
Robit vs. exact logistic: Robit(7) approximates the logistic to within 0.0006 but is not exact. For strict Bayesian logistic inference, Holmes-Held (2006) Kolmogorov-Smirnov (KS) scale mixture is preferable.
Degrees of freedom estimation: ECME profile likelihood search for ν can be noisy in small samples; placing a prior on ν and marginalizing is preferable in Bayesian settings.
Polychotomous extension: Liu (2006) mentions the multivariate binary extension briefly; a complete algorithm comparable to Holmes-Held's polychotomous Gibbs is not provided.