Summary
Albert and Chib (1997b) develop a unified Bayesian Markov chain Monte Carlo (MCMC) framework for fitting, criticizing, and comparing three non-nested ordinal regression models — the cumulative probit (McCullagh 1980), the sequential probit (Tutz 1990, 1991), and the two-step compound model (Tutz 1989). Because the models are non-nested, classical likelihood ratio tests are inapplicable; the paper instead uses Bayes factors (BFs) computed from Chib (1995) marginal likelihoods. The central algorithmic innovation is a log-spacing reparameterization of the ordered cut-points in the cumulative model that lifts them to an unrestricted real vector, enabling a tuned multivariate-t Metropolis-Hastings (MH) step that mixes "extremely well." Three methods for eliciting proper priors (needed for valid Bayes factors) are developed: training sample, imaginary prior sample, and Dirichlet-on-multinomial.
Key Claims
- Three non-nested ordinal models: cumulative model Pr(Y≤j∣β,γ)=Φ(γj−xi′β) with ordered cut-points; sequential model Pr(Yi=j∣Yi≥j,β,γ)=Φ(γj−xi′β) with unrestricted thresholds (discrete-hazard / continuation-ratio structure); two-step (compound) model partitioning J+1 categories into s subsets with a cumulative model at subset level and separate cumulative models within each subset.
- Cut-point reparameterization (Algorithm 1): transform ordered γ1≤⋯≤γJ−1 to unrestricted α via α1=logγ1, αj=log(γj−γj−1) for j≥2; inverse γj=∑i=1jexp(αi); MH proposal is a multivariate-t with mode α^ and curvature V from Newton-Raphson on lnπ(α∣y,β).
- Sequential model latent structure: each observation Yi=j requires ji=min{j+1,J} category-specific independent latent variables zij∼N(xi′β,1), giving a variable-dimension augmented data vector.
- Two-step posterior factorization: the joint posterior factors into t+1 independent components — subset-level ({γj},β0) and within-subset ({θj,r},βj) for j=1,…,t — so Algorithm 3 is simply t+1 independent runs of Algorithm 1.
- Marginal likelihood via Chib (1995): identity m(y)=f(y∣ψ∗)π(ψ∗)/π(ψ∗∣y) with posterior ordinate decomposed as π(β∗,α∗∣y)=π(β∗∣y)π(α∗∣y,β∗); β∗ ordinate estimated by averaging ϕk(β∗∣β^(g),B−1) over MCMC z-draws; α∗ ordinate estimated by Gaussian kernel smoothing (Scott 1992 bandwidth) from a reduced run fixing β=β∗.
- Three prior elicitation methods: (a) training sample — split data, fit flat-prior model to training portion, use posterior moments as hyperparameters; (b) imaginary prior sample — artificial dataset with equal ordinal level across all cells and no covariate associations; (c) Dirichlet-on-multinomial — Dirichlet distributions on response probability vectors πk at chosen covariate values, transformed via Jacobian to a prior on (β,γ).
- Bayesian latent residuals: ri=zi−xi′β with prior ri∼N(0,1); tail probability Pr(∣ri∣>2∣y)>0.05 flags poorly fitted observations; probability plot of posterior-mean ordered residuals against N(0,1) order statistics detects global misfit.
- National Longitudinal Survey of Youth (NLSY) educational attainment application (n=500 subsample, 5 categories, training sample prior): cumulative model wins over sequential (logBF=3.15); parent education dominant (log10BF≈18.96); race and region should be excluded (log10BF≈−1.2 to −2.0); gender marginal (log10BF≈0.02).
- Canada General Social Survey (GSS) physician visits application (n=1,000, two-step with 4 subsets): full two-step beats collapsed 4-category model (logBF21=−10.7); model with β2=0 slightly preferred over full model (logBF31=1.4), indicating covariates do not explain variation among high-visit counts.
- Algorithmic performance: 5,000 iterations / 100 burn-in; τ=1, ν=30 tuning constants; Algorithm 1 trace plots and autocorrelations show rapid mixing; results insensitive to MCMC design parameters.
Concepts Introduced or Extended
Entities Mentioned
Quotes
"The feature that makes this problem interesting is that the models are non-nested and standard classical methods for comparing these models are either inappropriate or difficult to apply." (p. 2)
"Our empirical experience with Algorithm 1 is that it is fast and mixes extremely well." (p. 11)
My Take
The paper's key technical contribution — the log-spacing reparameterization of cut-points — is elegant and practically important: it converts a constrained MH problem into an unconstrained one at the cost of a Jacobian, avoiding the ordered-parameter complications of Cowles (1996) and Chen-Nandram (1996). The three prior elicitation methods address a real gap: Bayes factors are sensitive to prior specification for non-nested models, and none of the three methods is obviously dominant (training sample wastes data; imaginary sample is artificial; Dirichlet-on-multinomial requires specifying covariate scenarios). The published follow-up, Albert-Chib (2001), focuses exclusively on the sequential model with the hospital length-of-stay application; the cumulative and two-step results here appear to remain as working paper contributions. The educational attainment Bayes factors (parent education log10BF≈19) are striking but depend heavily on the training-sample prior — a sensitivity analysis would strengthen the conclusions.