cognitive science · intermediate · 10 min read · Updated Nov 9, 2026

The Forgetting Curve: Mathematical Models & Optimal Spaced Repetition

Understand Hermann Ebbinghaus’s exponential forgetting curve, the mathematical modeling of memory stability, and how spaced retrieval practice halts memory decay.

By Dr. Clara Lindqvist (Head of Applied Mathematics)

Learning Objectives

  • •
    Explain the mathematical formulation of Ebbinghaus’s exponential retention function .
  • •
    Define memory stability () and describe how successive retrievals flatten the forgetting trajectory.
  • •
    Contrast active retrieval practice with passive re-reading using the testing effect evidence.
  • •
    Apply the Bjork framework of storage strength versus retrieval strength to optimize review intervals.
In 1885, German psychologist Hermann Ebbinghaus published the first empirical, quantitative study of human memory. His central finding was as sobering as it was consistent: without systematic reinforcement, learned information decays exponentially from biological memory within hours and days.

Why This Concept Matters

Understanding the mathematical dynamics of the forgetting curve transforms learning from an unstructured gamble into an engineered discipline. Rather than cramming repeatedly before exams, learners can leverage spaced repetition algorithms to schedule reviews at the exact moments of maximum consolidation efficiency.

Key Terminology

Retention Probability ()
The probability of successfully retrieving a specific memory from long-term biological storage at time after last exposure.
Memory Stability ()
The time required for retention probability to decay from 100% to ; measures how durable a memory trace has become.
The Spacing Effect
The robust cognitive finding that distributed study opportunities separated by temporal intervals produce far superior long-term retention than massed study (cramming).
The Testing Effect
The phenomenon where actively retrieving knowledge from memory dramatically enhances long-term retention compared to spending equal time passively re-reading.

1. The Ebbinghaus Discovery & The Exponential Decay Function

Hermann Ebbinghaus conducted rigorous self-experiments using thousands of standardized nonsense syllables (e.g., WID, ZOF, KAF) to eliminate confounding prior knowledge. By plotting his savings in relearning time across varying intervals, he discovered that forgetting follows an exponential decay curve.
Definition · Exponential Memory Retention Model
Retention probability at elapsed time decays exponentially, where is memory stability—the characteristic half-life factor of the memory trace.
Intuition: The steeper the slope, the faster you forget. Each successful spaced retrieval multiplies stability S, flattening the curve for the future.
Immediately after learning (), (100% retention). As time elapses, the rate of forgetting is steepest at the very beginning and gradually flattens out asymptotically.

2. Interactive Retention Curve & Rate of Forgetting

The interactive graph below plots the normalized forgetting function . Notice how the tangent line (instantaneous rate of forgetting ) is steepest near and levels off over time.
Function Graph

Exponential Retention Curve R(t) = e^(-t)

Interactive
0123451P(1.00, 0.37)Q(1.50, 0.22)
Secant Slope (Δy / Δx)
-0.289
Average rate over h = 0.50
Exact Derivative f'(1.0)
-0.368
Tangent slope = lim(h→0)
Approximation Error |m - f'|
0.0784
Decreases as h approaches 0
Retention decays rapidly in early intervals, with the tangent slope indicating the instantaneous rate of memory trace decay.

3. Memory Stability & The Spacing Effect

When a memory is first encoded, its stability is relatively short—often measured in hours. If the concept is reviewed too quickly (massed practice), cognitive effort is minimal and stability increases only marginally.
However, if retrieval occurs just as the memory approaches the threshold of forgetting (e.g., ), the brain must expend substantial cognitive effort to reconstruct the neural trace. This effort triggers synaptic consolidation, yielding an expanded stability :

In spaced repetition algorithms such as SuperMemo-2 (SM-2), each successful recall multiplies the previous interval by an Ease Factor (EF ≥ 1.3), resulting in expanding review schedules (1 day, 3 days, 8 days, 21 days...).

(1)
— First review after initial acquisition
(2)
— Second review interval
(3)
— Subsequent expanding intervals for EF = 2.5
The Desirable Difficulty Invariant
Cognitive psychologists Robert and Elizabeth Bjork coined the term Desirable Difficulties: conditions that create challenges for learners during acquisition that make retrieval slower and less fluid actually accelerate long-term retention and flexible transfer.

4. Retrieval Practice: The Testing Effect

In a landmark study published in Psychological Science, Roediger and Karpicke (2006) compared two learning conditions: repeated study (SSSS: reading a passage four times) versus retrieval practice (STTT: reading once, followed by three active recall recall tests with no restudy).
  • Immediate Testing (5 minutes): Students in the repeated study group performed slightly better, creating the metacognitive illusion that rereading was superior.
  • Delayed Testing (1 week later): The retrieval practice group retained 61% of the material, whereas the repeated rereading group retained only 40%—a 52% relative improvement directly attributable to active retrieval.

5. Storage Strength versus Retrieval Strength

To explain why students often feel confident after cramming but blank out on final exams, Bjork & Bjork proposed the New Theory of Disuse, establishing a critical distinction between two independent memory dimensions:
  • Storage Strength: A measure of how well-learned and interconnected a memory trace is with existing knowledge schemas. Storage strength is durable and never truly decreases.
  • Retrieval Strength: A measure of current situational accessibility. Retrieval strength decays rapidly with time and distraction, but can be artificially boosted by immediate recency (e.g., cramming five minutes before a test).
The Fluency Illusion Trap
High retrieval strength creates the dangerous subjective illusion of mastery: because material feels easy to read right now, you falsely assume you will remember it next month. Active self-testing exposes low storage strength while there is still time to remediate it.

6. Check Your Understanding

Check Your Understanding
According to the mathematical model of memory retention , what happens to the retention curve when memory stability is increased from 2 days to 10 days via spaced retrieval?
Flashcard Deck · standard mode

Memory Science: Forgetting Curves & Spacing Intervals

Master Ebbinghaus exponential decay, memory stability, testing effect advantages, and optimal review intervals.

Study Deck Quiz Mode
Cards →
Research & Foundations

Academic References & Verification

Foundational research, standard mathematical treatises, and verified peer-reviewed literature supporting this topic.

  1. Distributed Practice in Verbal Recall Tasks: A Review and Quantitative Synthesis

    Nicholas J. Cepeda, Harold Pashler, Edward Vul, John T. Wixted, & Doug Rohrer (2006). Psychological Bulletin, 132(3), 354–380.

    Synthesizes 317 distributed practice experiments across 184 articles, proving that expanding inter-study intervals dramatically increases long-term retention compared to massed study.

    The optimal spacing ratio depends on the target retention horizon; intervals must be calibrated so material is difficult to retrieve but not forgotten.

    doi:10.1037/0033-2909.132.3.354 Open access Primary source

  2. Improving Students’ Learning With Effective Learning Techniques: Promising Directions From Cognitive and Educational Psychology

    John Dunlosky, Katherine A. Rawson, Elizabeth J. Marsh, Mitchell J. Nathan, & Daniel T. Willingham (2013). Psychological Science in the Public Interest, 14(1), 4–58.

    Authoritative monograph evaluating 10 study techniques; designated practice testing (active recall) and distributed practice (spaced repetition) as High Utility, while rating passive rereading and highlighting as Low Utility.

    Low-utility techniques can be moderately helpful as an initial orientation, but relying on them for mastery is ineffective.

    doi:10.1177/1529100612453266 Open access Primary source

  3. The Science of Effective Learning With Spacing and Retrieval Practice

    Shana K. Carpenter, Steven C. Pan, & Andrew C. Butler (2022). Nature Reviews Psychology, 1(9), 496–511.

    Contemporary review exploring the cognitive mechanics of spacing and retrieval, explaining why learners intuitively resist spacing due to metacognitive illusions of short-term fluency.

    Because spacing feels subjectively harder than cramming, automated scheduling is valuable to overcome counterproductive study intuitions.

    doi:10.1038/s44159-022-00089-1 Primary source

  4. Test-Enhanced Learning: Taking Memory Tests Improves Long-Term Retention

    Henry L. Roediger III & Jeffrey D. Karpicke (2006). Psychological Science, 17(3), 249–255.

    Demonstrates that active memory retrieval via testing produces significantly higher long-term retention on delayed assessments (2 to 7 days) than repeated passive studying.

    Testing benefits are maximized when learners receive corrective feedback on incorrect responses to prevent error consolidation.

    doi:10.1111/j.1467-9280.2006.01693.x Open access Primary source

Recommended Further Reading

  • Ebbinghaus, H. (1885). Memory: A Contribution to Experimental Psychology. Teachers College, Columbia University.

    The historic foundational monograph introducing empirical memory testing and decay functions.

  • Brown, P. C., Roediger, H. L., & McDaniel, M. A. (2014). Make It Stick: The Science of Successful Learning. Harvard University Press.

    Accessible synthesis of cognitive science research on spaced repetition, retrieval practice, and elaboration.

Related Learning Resources

Computer Science · 10 min read · beginner

Binary Search: Logarithmic Divide-and-Conquer Search

Understand the logarithmic efficiency of binary search, its strict sorted-array precondition, interval halving mechanics, and edge case implementations.

#algorithms#binary-search
Interactive