Identifiability of Partial-Mastery Cognitive Diagnostic Models

Jun Wu, Patrícia Martinková, Elena Erosheva

Abstract

Partial-mastery (PM) cognitive diagnostic models (CDMs) extend traditional CDMs by replacing binary latent attribute mastery indicators with continuous mastery scores for multiple latent attributes. In PM-CDMs, each subject is characterized by a fixed continuous latent mastery vector, from which item-specific binary attribute profiles are independently generated. This formulation provides a bridge between classical CDMs and continuous latent variable models. Despite growing interest in PM-CDMs, their identifiability properties remain unexplored. In this work, we establish the first identifiability results for PM-CDMs. We derive sufficient conditions for identifiability that are direct analogues of established conditions for traditional CDMs. To develop the main argument, we use symbolic computation on a minimal example with five items and two latent attributes to show that the Jacobian of the model parameterization is generically nonzero. Combining tools from real analysis and algebraic statistics, we prove that this local property implies generic finite-to-one identifiability of the item parameters and the marginal distributions of the relevant latent attributes. We further show that if the $Q$-matrix contains such identifiable local structures for all attribute pairs, identifiability extends to the full PM-CDM. These findings provide a rigorous theoretical foundation for estimation and inference in partial-mastery cognitive diagnostic models.

Disclosure

“, by the Czech Science Foundation grant “Complex analysis of educational mea- surement data to understand cognitive demands of assessment tasks” number 25-16951S, and by the institutional support RVO 67985807. In preparing this manuscript, ChatGPT (OpenAI, 2026) was used for language editing and stylistical refinement. All content, including intellectual contributions, theoretical development, analysis, and interpre- tation, was developed by the authors. All AI-generated suggestions”

PDF page 26
Classification
Rewriting existing author-written text
Multiplier
4
Verified

Structural counts

Pages 30 pdf
Theorems 3 pdf fallback
Lemmas 1 pdf fallback
Propositions 4 pdf fallback
Corollaries 2 pdf fallback
Definitions 2 pdf fallback
Displayed equations 109 pdf fallback
Bibliography entries 0 pdf fallback
Appendix pages 0 estimated

Count notes

  • arXiv source was unavailable; PDF-text fallbacks were used.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.