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
1
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…