Pith. sign in

REVIEW 3 cited by

Improving Knowledge Tracing via Pre-training Question Embeddings

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 2012.05031 v1 pith:PUHMJU3J submitted 2020-12-09 cs.IR cs.LG

classification cs.IRcs.LG
keywords embeddingsinformationquestionquestionssidebeendeepknowledge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge tracing (KT) defines the task of predicting whether students can correctly answer questions based on their historical response. Although much research has been devoted to exploiting the question information, plentiful advanced information among questions and skills hasn't been well extracted, making it challenging for previous work to perform adequately. In this paper, we demonstrate that large gains on KT can be realized by pre-training embeddings for each question on abundant side information, followed by training deep KT models on the obtained embeddings. To be specific, the side information includes question difficulty and three kinds of relations contained in a bipartite graph between questions and skills. To pre-train the question embeddings, we propose to use product-based neural networks to recover the side information. As a result, adopting the pre-trained embeddings in existing deep KT models significantly outperforms state-of-the-art baselines on three common KT datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Uncertainty-aware Knowledge Tracing

    cs.LG 2025-01 conditional novelty 6.0 of 10

    UKT models student knowledge as Gaussian distributions, uses Wasserstein self-attention and an aleatory-uncertainty contrastive loss, and reports improved knowledge tracing prediction on six datasets.

  2. DKT2: Revisiting Applicable and Comprehensive Knowledge Tracing in Large-Scale Data

    cs.LG 2025-01 conditional novelty 5.0 of 10

    DKT2, an xLSTM-based model with Rasch embeddings and an IRT-style decomposition, generally beats 18 knowledge tracing baselines on three large datasets, though not on every metric or task.

  3. Sparse Binary Representation Learning for Knowledge Tracing

    cs.LG 2025-01 conditional novelty 5.0 of 10

    SBRKT learns sparse binary auxiliary knowledge concepts per exercise and uses them to boost Bayesian Knowledge Tracing on standard datasets.

Pith tools