Enhancing Knowledge Tracing through Leakage-Free and Recency-Aware Embeddings

• URL: http://arxiv.org/abs/2508.17092v1
• Date: Sat, 23 Aug 2025 17:13:25 GMT
• Title: Enhancing Knowledge Tracing through Leakage-Free and Recency-Aware Embeddings
• Authors: Yahya Badran, Christine Preisach,
• Abstract summary: Knowledge tracing (KT) aims to predict a student's future performance based on their sequence of interactions with learning content.<n>Some KT models are vulnerable to label leakage, in which input data inadvertently reveal the correct answer.<n>We propose a straightforward yet effective solution to prevent label leakage by masking ground-truth labels during input embedding construction.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge Tracing (KT) aims to predict a student's future performance based on their sequence of interactions with learning content. Many KT models rely on knowledge concepts (KCs), which represent the skills required for each item. However, some of these models are vulnerable to label leakage, in which input data inadvertently reveal the correct answer, particularly in datasets with multiple KCs per question. We propose a straightforward yet effective solution to prevent label leakage by masking ground-truth labels during input embedding construction in cases susceptible to leakage. To accomplish this, we introduce a dedicated MASK label, inspired by masked language modeling (e.g., BERT), to replace ground-truth labels. In addition, we introduce Recency Encoding, which encodes the step-wise distance between the current item and its most recent previous occurrence. This distance is important for modeling learning dynamics such as forgetting, which is a fundamental aspect of human learning, yet it is often overlooked in existing models. Recency Encoding demonstrates improved performance over traditional positional encodings on multiple KT benchmarks. We show that incorporating our embeddings into KT models like DKT, DKT+, AKT, and SAKT consistently improves prediction accuracy across multiple benchmarks. The approach is both efficient and widely applicable.

Related papers

• The Sweet Danger of Sugar: Debunking Representation Learning for Encrypted Traffic Classification [3.064166155269814]
  This paper critically reassesses proposals that exploit Representation Learning models to create traffic representations.<n>We introduce Pcap-Encoder, an LM-based representation learning model that we specifically design to extract features from protocol headers.<n>Our findings reveal flaws in dataset preparation and model training, calling for a better and more conscious test design.
  arXiv  Detail & Related papers  (2025-07-22T10:32:50Z)
• Hey, That's My Data! Label-Only Dataset Inference in Large Language Models [63.35066172530291]
  CatShift is a label-only dataset-inference framework.<n>It capitalizes on catastrophic forgetting: the tendency of an LLM to overwrite previously learned knowledge when exposed to new data.
  arXiv  Detail & Related papers  (2025-06-06T13:02:59Z)
• Towards Robust Knowledge Tracing Models via k-Sparse Attention [33.02197868261949]
  textscsparseKT is a simple yet effective framework to improve the robustness and generalization of the attention based DLKT approaches. We show that our textscsparseKT is able to help attentional KT models get rid of irrelevant student interactions.
  arXiv  Detail & Related papers  (2024-07-24T08:49:18Z)
• Downstream-Pretext Domain Knowledge Traceback for Active Learning [138.02530777915362]
  We propose a downstream-pretext domain knowledge traceback (DOKT) method that traces the data interactions of downstream knowledge and pre-training guidance. DOKT consists of a traceback diversity indicator and a domain-based uncertainty estimator. Experiments conducted on ten datasets show that our model outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-07-20T01:34:13Z)
• Addressing Label Leakage in Knowledge Tracing Models [0.0]
  We present methods to prevent label leakage in knowledge tracing (KT) models.<n>Our methods consistently outperform their original counterparts.<n> Notably, our methods are versatile and can be applied to a wide range of KT models.
  arXiv  Detail & Related papers  (2024-03-22T15:54:30Z)
• Improving Input-label Mapping with Demonstration Replay for In-context Learning [67.57288926736923]
  In-context learning (ICL) is an emerging capability of large autoregressive language models. We propose a novel ICL method called Sliding Causal Attention (RdSca) We show that our method significantly improves the input-label mapping in ICL demonstrations.
  arXiv  Detail & Related papers  (2023-10-30T14:29:41Z)
• Disentanglement via Latent Quantization [60.37109712033694]
  In this work, we construct an inductive bias towards encoding to and decoding from an organized latent space. We demonstrate the broad applicability of this approach by adding it to both basic data-re (vanilla autoencoder) and latent-reconstructing (InfoGAN) generative models.
  arXiv  Detail & Related papers  (2023-05-28T06:30:29Z)
• PEOPL: Characterizing Privately Encoded Open Datasets with Public Labels [59.66777287810985]
  We introduce information-theoretic scores for privacy and utility, which quantify the average performance of an unfaithful user. We then theoretically characterize primitives in building families of encoding schemes that motivate the use of random deep neural networks.
  arXiv  Detail & Related papers  (2023-03-31T18:03:53Z)
• Enhancing Multiple Reliability Measures via Nuisance-extended Information Bottleneck [77.37409441129995]
  In practical scenarios where training data is limited, many predictive signals in the data can be rather from some biases in data acquisition. We consider an adversarial threat model under a mutual information constraint to cover a wider class of perturbations in training. We propose an autoencoder-based training to implement the objective, as well as practical encoder designs to facilitate the proposed hybrid discriminative-generative training.
  arXiv  Detail & Related papers  (2023-03-24T16:03:21Z)
• Improved Adaptive Algorithm for Scalable Active Learning with Weak Labeler [89.27610526884496]
  Weak Labeler Active Cover (WL-AC) is able to robustly leverage the lower quality weak labelers to reduce the query complexity while retaining the desired level of accuracy. We show its effectiveness on the corrupted-MNIST dataset by significantly reducing the number of labels while keeping the same accuracy as in passive learning.
  arXiv  Detail & Related papers  (2022-11-04T02:52:54Z)
• pyKT: A Python Library to Benchmark Deep Learning based Knowledge Tracing Models [46.05383477261115]
  Knowledge tracing (KT) is the task of using students' historical learning interaction data to model their knowledge mastery over time. DLKT approaches are still left somewhat unknown and proper measurement and analysis of these approaches remain a challenge. We introduce a comprehensive python based benchmark platform, textscpyKT, to guarantee valid comparisons across DLKT methods.
  arXiv  Detail & Related papers  (2022-06-23T02:42:47Z)
• Code-DKT: A Code-based Knowledge Tracing Model for Programming Tasks [10.474382290378049]
  We propose Code-based Deep Knowledge Tracing (Code-DKT), a model that uses an attention mechanism to automatically extract and select domain-specific code features to extend DKT. We compared the effectiveness of Code-DKT against Bayesian and Deep Knowledge Tracing (BKT and DKT) on a dataset from a class of 50 students attempting to solve 5 programming assignments.
  arXiv  Detail & Related papers  (2022-06-07T19:29:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.