mlsanityData to 7 Oct 2026

LSTM-SAKT: LSTM-Encoded SAKT-like Transformer for Knowledge Tracing

arXiv 2102.00845 ↗First posted 28 Jan 2021cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper introduces the 2nd place solution for the Riiid! Answer Correctness Prediction in Kaggle, the world's largest data science competition website. This competition was held from October 16, 2020, to January 7, 2021, with 3395 teams and 4387 competitors. The main insights and contributions of this paper are as follows. (i) We pointed out existing Transformer-based models are suffering from a problem that the information which their query/key/value can contain is limited. To solve this problem, we proposed a method that uses LSTM to obtain query/key/value and verified its effectiveness. (ii) We pointed out 'inter-container' leakage problem, which happens in datasets where questions are sometimes served together. To solve this problem, we showed special indexing/masking techniques that are useful when using RNN-variants and Transformer. (iii) We found additional hand-crafted features are effective to overcome the limits of Transformer, which can never consider the samples older than the sequence length.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 8 of its 11 references that are in the map. First posted on arXiv 28 Jan 2021.

Builds on

8 of 11 references.

References · 8

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
  4. 2015Deep Knowledge Tracingcited by 328
  5. 2019A Self-Attentive model for Knowledge Tracingcited by 169
  6. 2019EdNet: A Large-Scale Hierarchical Dataset in Educationcited by 106
  7. 2020Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracingcited by 79
  8. 2020SAINT+: Integrating Temporal Features for EdNet Correctness Predictioncited by 57

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 1; 2025: 1.

5 papers.