Going Deep in Diagnostic Modeling: Deep Cognitive Diagnostic Models (DeepCDMs).

IF 3.1 2区 心理学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Psychometrika Pub Date : 2024-03-01 Epub Date: 2023-12-11 DOI:10.1007/s11336-023-09941-6
Yuqi Gu
{"title":"Going Deep in Diagnostic Modeling: Deep Cognitive Diagnostic Models (DeepCDMs).","authors":"Yuqi Gu","doi":"10.1007/s11336-023-09941-6","DOIUrl":null,"url":null,"abstract":"<p><p>Cognitive diagnostic models (CDMs) are discrete latent variable models popular in educational and psychological measurement. In this work, motivated by the advantages of deep generative modeling and by identifiability considerations, we propose a new family of DeepCDMs, to hunt for deep discrete diagnostic information. The new class of models enjoys nice properties of identifiability, parsimony, and interpretability. Mathematically, DeepCDMs are entirely identifiable, including even fully exploratory settings and allowing to uniquely identify the parameters and discrete loading structures (the \" <math><mi>Q</mi></math> -matrices\") at all different depths in the generative model. Statistically, DeepCDMs are parsimonious, because they can use a relatively small number of parameters to expressively model data thanks to the depth. Practically, DeepCDMs are interpretable, because the shrinking-ladder-shaped deep architecture can capture cognitive concepts and provide multi-granularity skill diagnoses from coarse to fine grained and from high level to detailed. For identifiability, we establish transparent identifiability conditions for various DeepCDMs. Our conditions impose intuitive constraints on the structures of the multiple <math><mi>Q</mi></math> -matrices and inspire a generative graph with increasingly smaller latent layers when going deeper. For estimation and computation, we focus on the confirmatory setting with known <math><mi>Q</mi></math> -matrices and develop Bayesian formulations and efficient Gibbs sampling algorithms. Simulation studies and an application to the TIMSS 2019 math assessment data demonstrate the usefulness of the proposed methodology.</p>","PeriodicalId":54534,"journal":{"name":"Psychometrika","volume":" ","pages":"118-150"},"PeriodicalIF":3.1000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Psychometrika","FirstCategoryId":"102","ListUrlMain":"https://doi.org/10.1007/s11336-023-09941-6","RegionNum":2,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/12/11 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Cognitive diagnostic models (CDMs) are discrete latent variable models popular in educational and psychological measurement. In this work, motivated by the advantages of deep generative modeling and by identifiability considerations, we propose a new family of DeepCDMs, to hunt for deep discrete diagnostic information. The new class of models enjoys nice properties of identifiability, parsimony, and interpretability. Mathematically, DeepCDMs are entirely identifiable, including even fully exploratory settings and allowing to uniquely identify the parameters and discrete loading structures (the " Q -matrices") at all different depths in the generative model. Statistically, DeepCDMs are parsimonious, because they can use a relatively small number of parameters to expressively model data thanks to the depth. Practically, DeepCDMs are interpretable, because the shrinking-ladder-shaped deep architecture can capture cognitive concepts and provide multi-granularity skill diagnoses from coarse to fine grained and from high level to detailed. For identifiability, we establish transparent identifiability conditions for various DeepCDMs. Our conditions impose intuitive constraints on the structures of the multiple Q -matrices and inspire a generative graph with increasingly smaller latent layers when going deeper. For estimation and computation, we focus on the confirmatory setting with known Q -matrices and develop Bayesian formulations and efficient Gibbs sampling algorithms. Simulation studies and an application to the TIMSS 2019 math assessment data demonstrate the usefulness of the proposed methodology.

Abstract Image

深入诊断模型:深度认知诊断模型(DeepCDMs)。
认知诊断模型(CDMs)是一种离散潜变量模型,在教育和心理测量中非常流行。在这项工作中,基于深度生成模型的优势和可识别性的考虑,我们提出了一个新的 DeepCDMs 系列,以寻找深度离散诊断信息。这一类新模型具有良好的可识别性、简约性和可解释性。在数学上,DeepCDMs 是完全可识别的,甚至包括完全探索性的设置,并允许唯一识别生成模型中所有不同深度的参数和离散负载结构("[公式:见正文]-矩阵")。从统计学角度看,DeepCDMs 是简洁的,因为它们可以使用相对较少的参数来表达数据模型,这要归功于深度。实际上,DeepCDM 是可解释的,因为收缩阶梯状的深度架构可以捕捉认知概念,并提供从粗粒度到细粒度、从高层次到细节的多粒度技能诊断。在可识别性方面,我们为各种 DeepCDM 建立了透明的可识别性条件。我们的条件对多个[公式:见正文]矩阵的结构施加了直观的约束,并启发了一个生成图,当深入时,潜在层越来越小。在估计和计算方面,我们将重点放在已知[公式:见正文]-矩阵的确证设置上,并开发了贝叶斯公式和高效的吉布斯采样算法。模拟研究和对 TIMSS 2019 数学评估数据的应用证明了所提方法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Psychometrika
Psychometrika 数学-数学跨学科应用
CiteScore
4.40
自引率
10.00%
发文量
72
审稿时长
>12 weeks
期刊介绍: The journal Psychometrika is devoted to the advancement of theory and methodology for behavioral data in psychology, education and the social and behavioral sciences generally. Its coverage is offered in two sections: Theory and Methods (T& M), and Application Reviews and Case Studies (ARCS). T&M articles present original research and reviews on the development of quantitative models, statistical methods, and mathematical techniques for evaluating data from psychology, the social and behavioral sciences and related fields. Application Reviews can be integrative, drawing together disparate methodologies for applications, or comparative and evaluative, discussing advantages and disadvantages of one or more methodologies in applications. Case Studies highlight methodology that deepens understanding of substantive phenomena through more informative data analysis, or more elegant data description.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信