Evidence map›Paper›PMID 30670661›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2019

Enhancing human learning via spaced repetition optimization.

Behzad Tabibian, Utkarsh Upadhyay, Abir De, Ali Zarezade, Bernhard Schölkopf, Manuel Gomez-Rodriguez

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 31 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
31citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

31 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Trial
  3. Trial
  4. Spaced learning versus traditional learning for pharmacists implementing β-lactam therapeutic drug monitoring.American journal of health-system pharmacy : AJHP : official journal of the American Society of Health-System Pharmacists · 2026
    Article
  5. From bugs to bots: learning infectious diseases in the AI era.Antimicrobial stewardship & healthcare epidemiology : ASHE · 2026
    Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Review
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. The advantage of distributed practice in a blended learning setting.Education and information technologies · 2021
    Article
  20. Article
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

6 authors.

Behzad TabibianNetworks Learning Group, Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany; me@btabibian.com.
Utkarsh UpadhyayNetworks Learning Group, Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany.
Abir DeNetworks Learning Group, Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany.
Ali ZarezadeNetworks Learning Group, Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany.ORCID 0000-0003-0192-6545
Bernhard SchölkopfEmpirical Inference Department, Max Planck Institute for Intelligent Systems, 72076 Tübingen, Germany.
Manuel Gomez-RodriguezNetworks Learning Group, Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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.

Indexed as

AlgorithmsModels, NeurologicalHumansLearningMental Recallhuman learningmarked temporal point processesmemorizationspaced repetitionstochastic optimal control

Identifiers

PMID30670661
PMCPMC6410796

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.