Extracting Causal Relations in Deep Knowledge Tracing
Not on the map. Why?
Abstract (arXiv)
A longstanding goal in computational educational research is to develop explainable knowledge tracing (KT) models. Deep Knowledge Tracing (DKT), which leverages a Recurrent Neural Network (RNN) to predict student knowledge and performance on exercises, has been proposed as a major advancement over traditional KT methods. Several studies suggest that its performance gains stem from its ability to model bidirectional relationships between different knowledge components (KCs) within a course, enabling the inference of a student's understanding of one KC from their performance on others. In this paper, we challenge this prevailing explanation and demonstrate that DKT's strength lies in its implicit ability to model prerequisite relationships as a causal structure, rather than bidirectional relationships. By pruning exercise relation graphs into Directed Acyclic Graphs (DAGs) and training DKT on causal subsets of the Assistments dataset, we show that DKT's predictive capabilities align strongly with these causal structures. Furthermore, we propose an alternative method for extracting exercise relation DAGs using DKT's learned representations and provide empirical evidence supporting our claim. Our findings suggest that DKT's effectiveness is largely driven by its capacity to approximate causal dependencies between KCs rather than simple relational mappings.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 18 references that are in the map. First posted on arXiv 6 Nov 2025.
Builds on
4 of 18 references.
References · 4
- 2022Knowledge Tracing: A Surveycited by 77
- 2022pyKT: A Python Library to Benchmark Deep Learning based Knowledge Tracing Modelscited by 52
- 2020HGKT: Introducing Hierarchical Exercise Graph for Knowledge Tracingcited by 12
- 2024A Survey of Explainable Knowledge Tracingcited by 7
Built on by
Not cited yet.