Enhancing Human Learning via Spaced Repetition Optimization
learning-sciencespaced-repetitionalgorithms
Abstract
PNAS paper developing computational frameworks for deriving optimal spaced repetition algorithms that adapt to individual learner performance.
Summary
This PNAS paper represents a major advance in moving from heuristic-based spaced repetition to principled, data-driven optimization.
Key Contributions:
- Mathematical framework for modeling memory decay and retrieval probability
- Algorithms that adapt spacing intervals based on individual learner responses
- Empirical validation showing significant improvements over traditional systems
Findings:
- Traditional algorithms like SM-2 (used in Anki) are rule-based heuristics with hard-coded parameters
- Adaptive algorithms that track individual item difficulty and learner ability outperform fixed schedules
- The optimal algorithm balances reviewing items about to be forgotten with introducing new material
This work influenced the development of modern systems like FSRS (Free Spaced Repetition Scheduler), which has been adopted by Anki and other platforms.