Pith. sign in

REVIEW 1 cited by

qDKT: Question-centric Deep Knowledge Tracing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.12442 v1 pith:O35PX6OU submitted 2020-05-25 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords qdktlearnermodelsquestionsknowledgetracingdeepindividual
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge tracing (KT) models, e.g., the deep knowledge tracing (DKT) model, track an individual learner's acquisition of skills over time by examining the learner's performance on questions related to those skills. A practical limitation in most existing KT models is that all questions nested under a particular skill are treated as equivalent observations of a learner's ability, which is an inaccurate assumption in real-world educational scenarios. To overcome this limitation we introduce qDKT, a variant of DKT that models every learner's success probability on individual questions over time. First, qDKT incorporates graph Laplacian regularization to smooth predictions under each skill, which is particularly useful when the number of questions in the dataset is big. Second, qDKT uses an initialization scheme inspired by the fastText algorithm, which has found success in a variety of language modeling tasks. Our experiments on several real-world datasets show that qDKT achieves state-of-art performance on predicting learner outcomes. Because of this, qDKT can serve as a simple, yet tough-to-beat, baseline for new question-centric KT models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Hierarchical Probabilistic Framework for Incremental Knowledge Tracing in Classroom Settings

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A hidden Markov tree over knowledge concepts with EM and one-step incremental updates outperforms deep and LLM knowledge tracing baselines in low-resource online classroom simulations.

Pith tools