This interesting new paper tries to improve on model-based SRS scheduling algorithms by adding *planning*—that is, given a student's time constraints, find an optimal sequence. Surprisingly, doesn't do significantly better than typical "greedy" approaches. arxiv.org/pdf/2102.04174
Conversation
Replying to
I guess I find that encouraging! A simple "schedule everything below a fixed predicted-recall threshold" model does as well as holistic planning optimization, (assuming you're already using a sophisticated model for predicting recall rates). Much more flexible this way.
1
18
n.b. they still find quite a large difference between an online per-item per-student estimator and a traditional Leitner model! But yes, still simpler than a Monte Carlo planner…
1
Replying to
Thanks for sharing! Do you know of any paper which evaluates SRS if there are "prerequistites" between flashcards. For example don't show flashcard B before the person learns flashcard A.
This paper seems to not explicitly model this, if I understand correctly
1
1
This Tweet was deleted by the Tweet author. Learn more
Show replies
Show additional replies, including those that may contain offensive content
Show


