KeenKT: Knowledge Mastery-State Disambiguation for Knowledge Tracing

• URL: http://arxiv.org/abs/2512.18709v1
• Date: Sun, 21 Dec 2025 12:01:10 GMT
• Title: KeenKT: Knowledge Mastery-State Disambiguation for Knowledge Tracing
• Abstract summary: We propose a Knowledge Mastery-State Disambiguation for Knowledge Tracing model (KeenKT)<n>KeenKT represents a student's knowledge state at each interaction using a Normal-Inverse-Gaussian (NIG) distribution.<n>Experiments on six public datasets demonstrate that KeenKT outperforms SOTA KT models in terms of prediction accuracy and sensitivity to behavioral fluctuations.
• Score: 19.574988464365603
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge Tracing (KT) aims to dynamically model a student's mastery of knowledge concepts based on their historical learning interactions. Most current methods rely on single-point estimates, which cannot distinguish true ability from outburst or carelessness, creating ambiguity in judging mastery. To address this issue, we propose a Knowledge Mastery-State Disambiguation for Knowledge Tracing model (KeenKT), which represents a student's knowledge state at each interaction using a Normal-Inverse-Gaussian (NIG) distribution, thereby capturing the fluctuations in student learning behaviors. Furthermore, we design an NIG-distance-based attention mechanism to model the dynamic evolution of the knowledge state. In addition, we introduce a diffusion-based denoising reconstruction loss and a distributional contrastive learning loss to enhance the model's robustness. Extensive experiments on six public datasets demonstrate that KeenKT outperforms SOTA KT models in terms of prediction accuracy and sensitivity to behavioral fluctuations. The proposed method yields the maximum AUC improvement of 5.85% and the maximum ACC improvement of 6.89%.

Related papers

• Disentangling Knowledge States with Ability and Proficiency Modeling for Knowledge Tracing [6.399286079325182]
  Knowledge tracing aims to predict students' future performance by modeling their evolving knowledge states from historical interactions.<n>We propose Phase-Aware Knowledge Tracing (PAKT), a KT framework that decomposes student interactions into ability and proficiency phases.<n>Our method consistently outperforms representative baselines, with a maximum AUC gain of 1.33% and an average gain of 0.82%.
  arXiv  Detail & Related papers  (2026-07-14T09:11:59Z)
• Efficient Machine Unlearning via Influence Approximation [75.31015485113993]
  Influence-based unlearning has emerged as a prominent approach to estimate the impact of individual training samples on model parameters without retraining.<n>This paper establishes a theoretical link between memorizing (incremental learning) and forgetting (unlearning)<n>We introduce the Influence Approximation Unlearning algorithm for efficient machine unlearning from the incremental perspective.
  arXiv  Detail & Related papers  (2025-07-31T05:34:27Z)
• Dynamic Programming Techniques for Enhancing Cognitive Representation in Knowledge Tracing [125.75923987618977]
  We propose the Cognitive Representation Dynamic Programming based Knowledge Tracing (CRDP-KT) model.<n>It is a dynamic programming algorithm to optimize cognitive representations based on the difficulty of the questions and the performance intervals between them.<n>It provides more accurate and systematic input features for subsequent model training, thereby minimizing distortion in the simulation of cognitive states.
  arXiv  Detail & Related papers  (2025-06-03T14:44:48Z)
• DASKT: A Dynamic Affect Simulation Method for Knowledge Tracing [51.665582274736785]
  Knowledge Tracing (KT) predicts future performance by students' historical computation, and understanding students' affective states can enhance the effectiveness of KT.<n>We propose Affect Dynamic Knowledge Tracing (DASKT) to explore the impact of various student affective states on their knowledge states.<n>Our research highlights a promising avenue for future studies, focusing on achieving high interpretability and accuracy.
  arXiv  Detail & Related papers  (2025-01-18T10:02:10Z)
• Uncertainty-aware Knowledge Tracing [2.8931305033614816]
  Knowledge Tracing (KT) is crucial in education assessment, which focuses on depicting students' learning states and assessing students' mastery of subjects.<n>Previous research commonly adopts deterministic representation to capture students' knowledge states, which neglects the uncertainty during student interactions.<n>We propose an Uncertainty-Aware Knowledge Tracing model (UKT) which employs distribution embeddings to represent the uncertainty in student interactions.
  arXiv  Detail & Related papers  (2025-01-09T18:17:27Z)
• Adaptive Explicit Knowledge Transfer for Knowledge Distillation [17.739979156009696]
  We show that the performance of logit-based knowledge distillation can be improved by effectively delivering the probability distribution for the non-target classes from the teacher model. We propose a new loss that enables the student to learn explicit knowledge along with implicit knowledge in an adaptive manner. Experimental results demonstrate that the proposed method, called adaptive explicit knowledge transfer (AEKT) method, achieves improved performance compared to the state-of-the-art KD methods.
  arXiv  Detail & Related papers  (2024-09-03T07:42:59Z)
• Robustness-Reinforced Knowledge Distillation with Correlation Distance and Network Pruning [3.1423836318272773]
  Knowledge distillation (KD) improves the performance of efficient and lightweight models.<n>Most existing KD techniques rely on Kullback-Leibler (KL) divergence.<n>We propose a Robustness-Reinforced Knowledge Distillation (R2KD) that leverages correlation distance and network pruning.
  arXiv  Detail & Related papers  (2023-11-23T11:34:48Z)
• Overcoming Generic Knowledge Loss with Selective Parameter Update [48.240683797965005]
  We propose a novel approach to continuously update foundation models. Instead of updating all parameters equally, we localize the updates to a sparse set of parameters relevant to the task being learned. Our method achieves improvements on the accuracy of the newly learned tasks up to 7% while preserving the pretraining knowledge with a negligible decrease of 0.9% on a representative control set accuracy.
  arXiv  Detail & Related papers  (2023-08-23T22:55:45Z)
• Efficient training of lightweight neural networks using Online Self-Acquired Knowledge Distillation [51.66271681532262]
  Online Self-Acquired Knowledge Distillation (OSAKD) is proposed, aiming to improve the performance of any deep neural model in an online manner. We utilize k-nn non-parametric density estimation technique for estimating the unknown probability distributions of the data samples in the output feature space.
  arXiv  Detail & Related papers  (2021-08-26T14:01:04Z)
• Deep Graph Memory Networks for Forgetting-Robust Knowledge Tracing [5.648636668261282]
  We propose a novel knowledge tracing model, namely emphDeep Graph Memory Network (DGMN) In this model, we incorporate a forget gating mechanism into an attention memory structure in order to capture forgetting behaviours. This model has the capability of learning relationships between latent concepts from a dynamic latent concept graph.
  arXiv  Detail & Related papers  (2021-08-18T12:04:10Z)
• Consistency and Monotonicity Regularization for Neural Knowledge Tracing [50.92661409499299]
  Knowledge Tracing (KT) tracking a human's knowledge acquisition is a central component in online learning and AI in Education. We propose three types of novel data augmentation, coined replacement, insertion, and deletion, along with corresponding regularization losses. Extensive experiments on various KT benchmarks show that our regularization scheme consistently improves the model performances.
  arXiv  Detail & Related papers  (2021-05-03T02:36:29Z)
• Towards Interpretable Deep Learning Models for Knowledge Tracing [62.75876617721375]
  We propose to adopt the post-hoc method to tackle the interpretability issue for deep learning based knowledge tracing (DLKT) models. Specifically, we focus on applying the layer-wise relevance propagation (LRP) method to interpret RNN-based DLKT model. Experiment results show the feasibility using the LRP method for interpreting the DLKT model's predictions.
  arXiv  Detail & Related papers  (2020-05-13T04:03:21Z)

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.