Enhancing human learning via spaced repetition optimization.
Spaced repetition is a technique for efficient memorization which uses repeated review of content following a schedule determined by a spaced repetition algorithm to improve long-term retention. However, current spaced repetition algorithms are simple rule-based heuristics with a few hard-coded parameters. Here, we introduce a flexible representation of spaced repetition using the framework of marked temporal point processes and then address the design of spaced repetition algorithms with provable guarantees as an optimal control problem for stochastic differential equations with jumps. For two well-known human memory models, we show that, if the learner aims to maximize recall probability of the content to be learned subject to a cost on the reviewing frequency, the optimal reviewing schedule is given by the recall probability itself. As a result, we can then develop a simple, scalable online spaced repetition algorithm, MEMORIZE, to determine the optimal reviewing times. We perform a large-scale natural experiment using data from Duolingo, a popular language-learning online platform, and show that learners who follow a reviewing schedule determined by our algorithm memorize more effectively than learners who follow alternative schedules determined by several heuristics.
['Tabibian|Behzad|B|', 'Upadhyay|Utkarsh|U|', 'De|Abir|A|', 'Zarezade|Ali|A|0000-0003-0192-6545', 'Schölkopf|Bernhard|B|', 'Gomez-Rodriguez|Manuel|M|']
D000465:Algorithms D006801:Humans D007858:Learning D011939:Mental Recall D008959:Models, Neurological
human learning spaced repetition memorization marked temporal point processes stochastic optimal control