Ordinal Regression

bayesianordinal-dataprobitlatent-variablemcmccut-pointmodel-comparisonmarginal-likelihoodmeasurement-theorylikerttype-i-errorordered-probit

Definition

Ordinal regression models the probability of a discrete ordered outcome Yi{1,,J+1}Y_i \in \{1,\ldots,J+1\} as a function of covariates xi\mathbf{x}_i using either a single latent continuous variable crossing ordered thresholds (cumulative model) or a sequence of binary decisions at each level (sequential model). The three principal non-nested specifications — cumulative probit, sequential probit, and two-step compound — differ in how they decompose Pr(Yi=j)\Pr(Y_i = j), and cannot be compared by classical likelihood ratio tests; Bayesian model comparison via Bayes factors is required.

Key Ideas

How It Works

Three Model Families

Cumulative probit (McCullagh 1980): Pr(Yijβ,γ)=Φ(γjxiβ),γ1γJ1\Pr(Y_i \leq j \mid \boldsymbol{\beta}, \boldsymbol{\gamma}) = \Phi(\gamma_j - \mathbf{x}_i'\boldsymbol{\beta}), \quad \gamma_1 \leq \cdots \leq \gamma_{J-1} A single latent variable ziN(xiβ,1)z_i \sim \mathcal{N}(\mathbf{x}_i'\boldsymbol{\beta}, 1) determines category via Yi=j    γj1<ziγjY_i = j \iff \gamma_{j-1} < z_i \leq \gamma_j. The ordering constraint on γ\boldsymbol{\gamma} is the central algorithmic difficulty.

Sequential probit (Tutz 1990, 1991): Pr(Yi=jYij,β,γ)=Φ(γjxiβ)\Pr(Y_i = j \mid Y_i \geq j, \boldsymbol{\beta}, \boldsymbol{\gamma}) = \Phi(\gamma_j - \mathbf{x}_i'\boldsymbol{\beta}) Each observation Yi=jY_i = j requires ji=min{j+1,J}j_i = \min\{j+1, J\} category-specific independent latent variables zijN(xiβ,1)z_{ij} \sim \mathcal{N}(\mathbf{x}_i'\boldsymbol{\beta}, 1). The thresholds γ\boldsymbol{\gamma} are unrestricted. Equivalent to a discrete-time hazard / continuation-ratio model. See Sequential Ordinal Model for a detailed treatment.

Two-step / compound model (Tutz 1989): Partition the J+1J+1 categories into ss ordered subsets; fit a cumulative probit at the subset level and a separate cumulative probit within each subset. The joint posterior factors into s+1s+1 independent components, so inference reduces to s+1s+1 parallel applications of the cumulative algorithm.

Cut-Point Reparameterization (Algorithm 1 of Albert-Chib 1997b)

To handle the ordered-threshold constraint in the cumulative and two-step models, transform γ\boldsymbol{\gamma} to an unrestricted vector α\boldsymbol{\alpha}: α1=logγ1,αj=log(γjγj1),j2\alpha_1 = \log \gamma_1, \qquad \alpha_j = \log(\gamma_j - \gamma_{j-1}), \quad j \geq 2 Inverse: γj=k=1jexp(αk)\text{Inverse: } \gamma_j = \sum_{k=1}^{j} \exp(\alpha_k) A multivariate-tt Metropolis-Hastings proposal fT(αα^,τ2V,ν)f_T(\boldsymbol{\alpha} \mid \hat{\boldsymbol{\alpha}}, \tau^2 V, \nu) is centred at the mode α^\hat{\boldsymbol{\alpha}} with curvature VV from Newton-Raphson on lnπ(αy,β)\ln \pi(\boldsymbol{\alpha} \mid \mathbf{y}, \boldsymbol{\beta}). The Jacobian γ/α=jexp(αj)|\partial\boldsymbol{\gamma}/\partial\boldsymbol{\alpha}| = \prod_j \exp(\alpha_j) adjusts the acceptance ratio.

Marginal Likelihood Computation (Chib 1995)

Using the Chib (1995) identity evaluated at a posterior mode ψ=(β,α)\psi^* = (\boldsymbol{\beta}^*, \boldsymbol{\alpha}^*): lnm(y)=lnf(yψ)+lnπ(ψ)lnπ(ψy)\ln m(\mathbf{y}) = \ln f(\mathbf{y} \mid \psi^*) + \ln \pi(\psi^*) - \ln \pi(\psi^* \mid \mathbf{y}) The posterior ordinate is decomposed as π(β,αy)=π(βy)π(αy,β)\pi(\boldsymbol{\beta}^*, \boldsymbol{\alpha}^* \mid \mathbf{y}) = \pi(\boldsymbol{\beta}^* \mid \mathbf{y}) \cdot \pi(\boldsymbol{\alpha}^* \mid \mathbf{y}, \boldsymbol{\beta}^*). The β\boldsymbol{\beta}^* ordinate is estimated by Rao-Blackwellisation over MCMC latent-variable draws; the α\boldsymbol{\alpha}^* ordinate by Gaussian kernel smoothing (Scott 1992 bandwidth) from a reduced run fixing β=β\boldsymbol{\beta} = \boldsymbol{\beta}^*.

Prior Elicitation for Bayes Factors

Why It Matters

Failure Modes of Metric Models for Ordinal Data

Liddell-Kruschke (2019) prove that applying metric models (t-test, analysis of variance (ANOVA), regression) to ordinal data can produce all three categories of inferential error. The root cause is geometric: the ordinal mean Yˉ(μ,σ)=kk[Φ((θkμ)/σ)Φ((θk1μ)/σ)]\bar{Y}(\mu,\sigma) = \sum_{k} k \bigl[\Phi\bigl((\theta_k - \mu)/\sigma\bigr) - \Phi\bigl((\theta_{k-1}-\mu)/\sigma\bigr)\bigr] is a sigmoid function of the latent mean μ\mu, with shape controlled by the latent standard deviation (SD) σ\sigma. Two groups with different σ\sigma trace two distinct sigmoid curves over μ\mu. Any vertical slice (same μ\mu, different σ\sigma) or horizontal slice (same Yˉ\bar{Y}, different μ\mu) through those curves generates an error.

False alarm (Type I): Groups with equal latent means μ1=μ2\mu_1 = \mu_2 but unequal latent SDs σ1σ2\sigma_1 \neq \sigma_2 produce unequal ordinal means Yˉ1Yˉ2\bar{Y}_1 \neq \bar{Y}_2. A metric model reports a spurious group effect.

Miss (Type II): Groups with unequal latent means μ1μ2\mu_1 \neq \mu_2 can have equal ordinal means when the sigmoid curves intersect at those μ\mu values. A metric model reports no effect.

Inversion: When the two sigmoid curves cross, the ordinal difference Yˉ1Yˉ2\bar{Y}_1 - \bar{Y}_2 can have the opposite sign from the latent difference μ1μ2\mu_1 - \mu_2. Extends to factorial interactions (a genuine cross-over becomes non-crossing and vice versa) and trend analyses.

Two things that do not help: (a) averaging multiple correlated Likert items preserves the sigmoidal distortion — all three failure modes persist; (b) equal observed SDs across groups do not imply equal latent SDs.

Empirical prevalence: An audit of the Journal of Personality and Social Psychology (JPSP), Psychological Science (PS), and Journal of Experimental Psychology: General (JEP:G) (2016) found that 100% of 68 articles using Likert data analysed it with metric models.

Open Questions

Related