Leitner Queue Network

Theory · All theories
Evidence · 2 claims (1 for, 1 mixed) · 1 study (1 causal), q1 · 0 of 1 report an effect size · 2 claims rest on one study

Description

The Leitner Queue Network is the article's stochastic model of a spaced repetition system, embedding an exponential forgetting curve in a network of queues, one per Leitner deck; it is "based on ideas from queueing theory and job scheduling". New items enter deck 1, recalled items move up, forgotten items move down, and a static schedule chooses an arrival rate and per-deck review rates to maximize the rate of mastered items.

Design Implications

Context

Requirements

• A review frequency budget U divided between new items and deck reviews, with review instances following a Poisson process.
• Restriction to static scheduling policies: an arrival rate for new items and a service rate per deck.
• The exponential forgetting curve with deck position as memory strength to set recall probabilities.

Constraints

• The article focuses on the long-term learning regime, where available items far outnumber the learner's time to memorize them.
• It assumes a single global item difficulty for simplicity; item-specific difficulty is handled by discretizing into bins and running parallel networks.
• The time-inhomogeneous Markov chain does not admit a closed-form program for optimizing the review schedule without an approximation.

Target Learners

• Learners memorizing a very large set of items with flashcard software, e.g., foreign-language vocabulary

Target Learning Objectives

• Long-term retention and mastery of many flashcard items
• Designing review schedules for spaced repetition software

Claims

• Leitner Queue Network Phase Transition In Learning Rate [+M]
• Mean Recall Approximation Matches Clocked Delay Simulation At Low Arrival Rates [~W]

Related Theories

• Spaced Repetition
• Spaced Repetition Scheduling
• Flashcards

Examples

-

Key Sources

• Reddy, S., Labutov, I., Banerjee, S., & Joachims, T. (2016). Unbounded Human Learning: Optimal Scheduling for Spaced Repetition. KDD ’16, San Francisco, CA, USA. https://doi.org/10.1145/2939672.2939850

Page metadata

Field	Value
type	theory
title	Leitner Queue Network
description	The Leitner Queue Network is the article's stochastic model of a spaced repetition system, embedding an exponential forgetting curve in a network of queues, one per Leitner deck; it is "based on ideas from queueing th...
status	review
canonical	True
generated	by claude/unspecified on 2026-09-24
trust	unverified — no one has confirmed this page's content
sources	1 — reddy-2016

Frontmatter is the page's machine-readable record — see the Schema & Guide.