Papers › DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed...

DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills

14 May 2019arXiv:1905.06873archive 2025-07-28

Benoît Choffin, Fabrice Popineau, Yolaine Bourda, Jill-Jênn Vie

Spaced repetition is among the most studied learning strategies in the cognitive science literature. It consists in temporally distributing exposure to an information so as to improve long-term memorization. Providing students with an adaptive and personalized distributed practice schedule would benefit more than just a generic scheduler. However, the applicability of such adaptive schedulers seems to be limited to pure memorization, e.g. flashcards or foreign language learning. In this article, we first frame the research problem of optimizing an adaptive and personalized spaced repetition scheduler when memorization concerns the application of underlying multiple skills. To this end, we choose to rely on a student model for inferring knowledge state and memory dynamics on any skill or combination of skills. We argue that no knowledge tracing model takes both memory decay and multiple skill tagging into account for predicting student performance. As a consequence, we propose a new student learning and forgetting model suited to our research problem: DAS3H builds on the additive factor models and includes a representation of the temporal distribution of past practice on the skills involved by an item. In particular, DAS3H allows the learning and forgetting curves to differ from one skill to another. Finally, we provide empirical evidence on three real-world educational datasets that DAS3H outperforms other state-of-the-art EDM models. These results suggest that incorporating both item-skill relationships and forgetting effect improves over student models that consider one or the other.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.06873")

Code

Syntology Ran 5 of 22 code samples harvested from 3 repositories linked to this paper; 17 have no recorded run. Of those that ran: 1 ran · honoured contract; 2 ran · violated contract; 2 ran · our draft was wrong.

By repository: official repository: 3 samples from 1 repository, 0 ran; community (archive-listed): 16 samples from 2 repositories, 4 ran; 3 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

BenoitChoffin/das3h officialmentioned in papermentioned on GitHub report
jilljenn/ktm mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

22 samples harvested; 5 ran; 1 honoured the contract we drafted; 17 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
2ran · violated contract
2ran · our draft was wrong
17unverified

Licence: 9 of the 22 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

prepare_assistments09 BenoitChoffin/das3h/prepare_data.py official repository unverified no licence file found · pointer only · 224b607a230ed110 · report
prepare_assistments12 BenoitChoffin/das3h/prepare_data.py official repository unverified no licence file found · pointer only · fb1e5dedc64169c2 · report
prepare_kddcup10 BenoitChoffin/das3h/prepare_data.py official repository unverified no licence file found · pointer only · 2c2c53f6ecafa3b8 · report
sigmoid jilljenn/ktm/fm.py community (archive-listed) ran · violated contract fingerprinted MIT (permissive) · b8e95809ca2c17c9 · report
identity jilljenn/ktm/encode_tw.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 9910e2fc297f8665 · report
phi theophilegervet/learner-performance-prediction/encode.py community (archive-listed) ran · violated contract fingerprinted no licence file found · pointer only · 7ebe2a9b54bc2a7f · report
prepare_batches theophilegervet/learner-performance-prediction/train_dkt2.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · c24c6778f1fe0629 · report
auroc jilljenn/ktm/dmirt.py community (archive-listed) unverified MIT (permissive) · 2923dba19a371ca3 · report
avgstd jilljenn/ktm/eval_metrics.py community (archive-listed) unverified MIT (permissive) · 5e609ea9a23743e7 · report
get_data theophilegervet/learner-performance-prediction/train_dkt2.py community (archive-listed) unverified no licence file found · pointer only · 58972fb2c9b9a7ba · report
get_paths jilljenn/ktm/dataio.py community (archive-listed) unverified MIT (permissive) · 3e1af9b2f8b525b2 · report
log_loss jilljenn/ktm/ofm.py community (archive-listed) unverified MIT (permissive) · b147ec392bdd9573 · report
log_loss jilljenn/ktm/omirt.py community (archive-listed) unverified MIT (permissive) · 7eb65870990ef53f · report
make_ones jilljenn/ktm/dmirt.py community (archive-listed) unverified MIT (permissive) · 64af9e5b43423566 · report
onehotize jilljenn/ktm/encode.py community (archive-listed) unverified MIT (permissive) · c3cdf4c3742ce2ee · report
sample_pairs jilljenn/ktm/bijection.py community (archive-listed) unverified MIT (permissive) · 4d602f92c30e6649 · report
save_folds jilljenn/ktm/dataio.py community (archive-listed) unverified MIT (permissive) · 37d6555428854969 · report
save_weak_folds jilljenn/ktm/dataio.py community (archive-listed) unverified MIT (permissive) · 7310e210e2ce24c8 · report
sigmoid jilljenn/ktm/ofm.py community (archive-listed) unverified MIT (permissive) · 79b01af220b1e28c · report
prepare_batches identical code first harvested elsewhere ran · our draft was wrong fingerprinted licence of this copy not recorded · f2254f62decab8a1 · report
compute_auc identical code first harvested elsewhere unverified licence of this copy not recorded · 63379c3778af65f9 · report
get_data identical code first harvested elsewhere unverified licence of this copy not recorded · a79ac5e51695f207 · report

Tasks

Knowledge TracingMemorizationScheduling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections