Table of Contents
Fetching ...

Covariate-assisted Grade of Membership Models via Shared Latent Geometry

Zhiyu Xu, Yuqi Gu

TL;DR

The paper tackles latent structure recovery in multivariate categorical data when auxiliary covariates are available, criticizing joint-likelihood approaches for their computational burden and misspecification sensitivity.It introduces a covariate-assisted GoM framework that leverages a shared low-rank simplex geometry between responses and covariates via a likelihood-free spectral estimator, incorporating a balance parameter $\alpha$ and heteroskedastic PCA (HeteroPCA).Theoretical results show weaker identifiability requirements than covariate-free GoM and provide finite-sample, entrywise error bounds for mixed membership scores $\boldsymbol{\Pi}$ and item/covariate parameters $\boldsymbol{\Theta},\mathbf{M}$, with faster convergence in high dimensions when covariates are informative.Empirical evidence from simulations and a TIMSS educational assessment application demonstrates improved accuracy, computational efficiency, and interpretability, supported by an open-source code release.

Abstract

The grade of membership model is a flexible latent variable model for analyzing multivariate categorical data through individual-level mixed membership scores. In many modern applications, auxiliary covariates are collected alongside responses and encode information about the same latent structure. Traditional approaches to incorporating such covariates typically rely on fully specified joint likelihoods, which are computationally intensive and sensitive to misspecification. We introduce a covariate-assisted grade of membership model that integrates response and covariate information by exploiting their shared low-rank simplex geometry, rather than modeling their joint distribution. We propose a likelihood-free spectral estimation procedure that combines heterogeneous data sources through a balance parameter controlling their relative contribution. To accommodate high-dimensional and heteroskedastic noise, we employ heteroskedastic principal component analysis before performing simplex-based geometric recovery. Our theoretical analysis establishes weaker identifiability conditions than those required in the covariate-free model, and further derives finite-sample, entrywise error bounds for both mixed membership scores and item parameters. These results demonstrate that auxiliary covariates can provably improve latent structure recovery, yielding faster convergence rates in high-dimensional regimes. Simulation studies and an application to educational assessment data illustrate the computational efficiency, statistical accuracy, and interpretability gains of the proposed method. The code for reproducing these results is open-source and available at \texttt{https://github.com/Toby-X/Covariate-Assisted-GoM}

Covariate-assisted Grade of Membership Models via Shared Latent Geometry

TL;DR

The paper tackles latent structure recovery in multivariate categorical data when auxiliary covariates are available, criticizing joint-likelihood approaches for their computational burden and misspecification sensitivity.It introduces a covariate-assisted GoM framework that leverages a shared low-rank simplex geometry between responses and covariates via a likelihood-free spectral estimator, incorporating a balance parameter $\alpha$ and heteroskedastic PCA (HeteroPCA).Theoretical results show weaker identifiability requirements than covariate-free GoM and provide finite-sample, entrywise error bounds for mixed membership scores $\boldsymbol{\Pi}$ and item/covariate parameters $\boldsymbol{\Theta},\mathbf{M}$, with faster convergence in high dimensions when covariates are informative.Empirical evidence from simulations and a TIMSS educational assessment application demonstrates improved accuracy, computational efficiency, and interpretability, supported by an open-source code release.

Abstract

The grade of membership model is a flexible latent variable model for analyzing multivariate categorical data through individual-level mixed membership scores. In many modern applications, auxiliary covariates are collected alongside responses and encode information about the same latent structure. Traditional approaches to incorporating such covariates typically rely on fully specified joint likelihoods, which are computationally intensive and sensitive to misspecification. We introduce a covariate-assisted grade of membership model that integrates response and covariate information by exploiting their shared low-rank simplex geometry, rather than modeling their joint distribution. We propose a likelihood-free spectral estimation procedure that combines heterogeneous data sources through a balance parameter controlling their relative contribution. To accommodate high-dimensional and heteroskedastic noise, we employ heteroskedastic principal component analysis before performing simplex-based geometric recovery. Our theoretical analysis establishes weaker identifiability conditions than those required in the covariate-free model, and further derives finite-sample, entrywise error bounds for both mixed membership scores and item parameters. These results demonstrate that auxiliary covariates can provably improve latent structure recovery, yielding faster convergence rates in high-dimensional regimes. Simulation studies and an application to educational assessment data illustrate the computational efficiency, statistical accuracy, and interpretability gains of the proposed method. The code for reproducing these results is open-source and available at \texttt{https://github.com/Toby-X/Covariate-Assisted-GoM}
Paper Structure (48 sections, 35 theorems, 256 equations, 7 figures, 3 algorithms)

This paper contains 48 sections, 35 theorems, 256 equations, 7 figures, 3 algorithms.

Key Result

Proposition 1

Under Assumption assump:extreme, the eigenspace $\mathbf{U}$ of $\mathcal{G}=\mathcal{R}\mathcal{R}^\top + \alpha \mathcal{X}\mathcal{X}^\top$ in eqn:oracle_g satisfies, where $S=(S_1,\dots,S_K)$ is one set of the indices of the $K$ pure subjects for each extreme latent profile; i.e., $\boldsymbol{\Pi}_{S,:} = \mathbf I_K$. Further, $\boldsymbol{\Pi}$ can also be represented as,

Figures (7)

  • Figure 1: The $x$ axis shows different values of $\alpha$ and the $y$ axis the prediction error (\ref{['eqn:mae_pred']}) for the first row, and the mean absolute error between $\widehat{\boldsymbol{\Pi}}$ and $\boldsymbol{\Pi}$ for the second row.
  • Figure 2: Comparison of different estimation methods. CoGoM represents the estimator of our proposed method. GoM_JML represents the estimator computed by the joint maximum likelihood method. GoM_SVD represents the grade of membership model estimated by spectral methods. The $x$ axis for each plot is the sample size $N$. Our proposed method is superior to JML in both computation efficiency and estimation accuracy.
  • Figure 3: Boxplots of the estimation accuracy of singular value decomposition on the stacked matrix and our proposed method in mean absolute error. The $y$-axis is the mean absolute error between $\widehat{\boldsymbol{\Pi}}$ and $\boldsymbol{\Pi}$. The $x$-axis for the figure on the left is different variance of noise, and for the figure on the right different ratios of the number of columns of the response matrix and the covariate matrix.
  • Figure 4: The boxplot of estimation error of $\boldsymbol{\Pi}$ in two-to-infinity norm. The $y$-axis is the two-to-infinity norm. The $x$-axis is $\beta$ that represents the degree of heteroscedasticity. HeteroPCA represents the result of the heteroskedastic-principal-component-analysis-based estimator, and SVD for the singular-value-decomposition-based one.
  • Figure 5: Cross-validated prediction error in mean absolute error by Algorithm \ref{['alg:cv']}. The $x$-axis represents different values of $\alpha$. The $y$-axis is the mean absolute error. The blue line is the fitted loess line.
  • ...and 2 more figures

Theorems & Definitions (67)

  • Definition 1: Pure subject
  • Proposition 1
  • Definition 2
  • Theorem 1: Identifiability of $\boldsymbol{\Pi}$ and $\mathcal{D}$
  • Proposition 2: Identifiability of $\boldsymbol{\Theta}$ and $\mathbf{M}$
  • Theorem 2
  • Corollary 1
  • Theorem 3
  • Corollary 2
  • Proposition A.1
  • ...and 57 more