Pith. sign in

REVIEW 1 cited by

Explainable Few-shot 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 2405.14391 v2 pith:KHSGWIRF submitted 2024-05-23 cs.AI cs.CLcs.CY

classification cs.AIcs.CLcs.CY
keywords knowledgetracingstudentdeepexplainablefew-shotfuturelanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge tracing (KT), aiming to mine students' mastery of knowledge by their exercise records and predict their performance on future test questions, is a critical task in educational assessment. While researchers achieved tremendous success with the rapid development of deep learning techniques, current knowledge tracing tasks fall into the cracks from real-world teaching scenarios. Relying heavily on extensive student data and solely predicting numerical performances differs from the settings where teachers assess students' knowledge state from limited practices and provide explanatory feedback. To fill this gap, we explore a new task formulation: Explainable Few-shot Knowledge Tracing. By leveraging the powerful reasoning and generation abilities of large language models (LLMs), we then propose a cognition-guided framework that can track the student knowledge from a few student records while providing natural language explanations. Experimental results from three widely used datasets show that LLMs can perform comparable or superior to competitive deep knowledge tracing methods. We also discuss potential directions and call for future improvements in relevant topics.

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