The Knowledge Tracing Algorithm does not suffer the identifiability problem: all four parameters affect its behavior separately¶
Claim · All claims
Evidence · 1 study · theoreticalr3·q2
Currency · newest study 2013 · not yet checked against its sources · not reviewed by a person · overdue for a recheck since 2016: tool and model accuracy changes quickly
Subclaims¶
Reading the evidence codes
q is the design tier, i the impact, n the sample, and the kind with its r
the rigour judged within that kind: what each code means.
This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.
q2 i? So long as there are both correct and incorrect steps, no redefinition of 1−P(Lj|Oj) can be compensated by redefining other parameters in both recursion equations, so all four model parameters are needed. → Brett Van de Sande 2013
Evidence¶
Brett Van de Sande 2013¶
Van de Sande, B. (2013). Properties of the Bayesian Knowledge Tracing Model. Journal of Educational Data Mining, 5(2). doi:10.5281/zenodo.3554629
q2 · i? · theoretical · r3
Analytical argument (Section 4): P(G) appears with a different functional form in the numerator of each of Eqns. (11) and (12), so 'all four model parameters are needed to define the behavior of the Knowledge Tracing Algorithm.'
"Finally, the “Identifiability Problem” for the Knowledge Tracing Algorithm does not exist, so long as there are both correct and incorrect steps."
Discussion¶
Related Claims¶
- Fixed point analysis of the Knowledge Tracing Algorithm yields parameter constraints P(G)+P(S)<1 and 0<P(T)<(1−P(S))/(1−P(G)) for sensible behavior — related
- BKT-BF suffers high computational cost and does not resolve BKT's identifiability problem, while EM is cheaper but suffers local minima — related
- The HMM form of BKT, solved analytically, is a three-parameter exponential in opportunity number — related
- Under standard BKT with non-degenerate parameters, the mastery probability stays above the learn rate even after unboundedly many incorrect responses — related
- A Hidden Markov Model over knowledge states identifies Analytical Thinking (A5) as the learning bottleneck with the lowest forward transition probability — related
- The identifiability problem of the BKT HMM arises because combinations of P(G) and P(L0) with the same product A give identical functional forms — related
- The exponential functional form of the BKT Markov chain calls into question the popular practice of fitting that model form to student data — related
Page metadata
| Field | Value |
|---|---|
type |
claim |
id |
kt-algorithm-no-identifiability-problem |
title |
The Knowledge Tracing Algorithm does not suffer the identifiability problem: all four parameters affect its behavior separately |
description |
The Knowledge Tracing Algorithm does not suffer the identifiability problem: all four parameters affect its behavior separately |
status |
review |
evidence_strength |
moderate |
newest_evidence |
2013 |
recheck_by |
2016 |
generated |
by process:wiki-ingest on 2026-09-25 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — brett-van-de-sande-2013 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.