A solvable connectionist model of immediate recall of ordered lists

Neil BurgessNeurIPS 1994 · OpenReview

Published by Neil Burgess in 1995, this paper presents a landmark connectionist (neural network) model that explains how our brains temporarily store and recall ordered lists, such as a phone number or a grocery list.

The Problem with "Chaining"

Psychologists have long used the "Articulatory Loop" (AL) model to describe how verbal information is held in mind for a few seconds. However, the AL model is largely descriptive; it doesn't explain how the brain implements this or why specific types of errors occur.

The dominant theory at the time was "chaining," where each item in a list acts as the cue for the next (A triggers B, B triggers C). The problem with chaining is that if you forget B, the whole sequence collapses. Human data shows we don't fail that way; we often make "transposition errors" (swapping neighboring items) or "intrusions" (accidentally grabbing an item from a previous list but in the correct position). Burgess sought to build a model that could explain these nuances through a robust neural architecture.

A Context-Driven Neural Architecture

Burgess introduces a "solvable" neural network model for short-term memory that replaces traditional chaining mechanisms with a time-varying context signal.

The connectionist model architecture showing the time-varying context signal and phoneme inputs feeding into a competitive item layer.

The model consists of three layers of artificial neurons:

  1. Context Layer: Provides a repeatable, time-varying signal that acts as a temporal scaffold.
  2. Phoneme Layer: Represents the sounds of the items (the "phonological store").
  3. Item Layer: Represents the words or digits themselves.

Key Innovations

  • Context over Chaining: Instead of items triggering each other, items are associated with a "context" signal that moves like a sliding window across the list's duration. This explains why we can forget one item but still remember the rest of the list in the correct order.
  • Dual-Scale Plasticity: Connections use Hebbian learning with two components: a "one-shot" short-term weight that decays quickly and an incremental long-term weight that builds up with repetition.
  • Competitive Queuing: Recall is a "Winner-Take-All" (WTA) process. The item with the strongest input wins and is "spoken" (output). Once output, that item is temporarily inhibited so the next strongest item can take its turn.
  • Mathematical Solvability: Unlike many neural models that require thousands of simulations to understand, Burgess uses a softmax function approximation to analytically estimate error probabilities.

Validation and Key Results

The model was validated against classic experimental psychological data, including studies by Baddeley, Hulme et al., and Guildford & Dallenbach.

Model results demonstrating the characteristic "bowed" serial position curve, matching human recall performance.

By combining dual-scale Hebbian plasticity with competitive queuing, the model successfully replicates a wide array of human psychological data:

  • Serial Position Curve: The model perfectly replicates the "bowed" shape of human memory—we are best at remembering the beginning (primacy) and end (recency) of a list.
  • Phonemic Interference: Because items are linked to phoneme nodes, similar-sounding words have overlapping representations. When noise is added during recall, these overlaps lead to "phonemic similarity effects," where similar items are easily confused.
  • Memory Span vs. Articulation Rate: The model matches the linear human data, showing that the faster you can "sub-vocally rehearse," the more items you can keep active before they decay.
  • Locality of Errors: The decaying inhibition mechanism ensures that if you make a mistake and say the 3rd item instead of the 2nd, the 2nd item is still the most likely candidate to be said next, mirroring human "transposition" patterns.

Limitations

While groundbreaking, the model has a few limitations:

  • Internal Word Structure: It treats words as collections of phonemes but struggles to explain how the internal order of those phonemes is learned.
  • The "New Item" Problem: The model assumes item nodes already exist and doesn't explain how the brain "recruits" a brand-new node for a novel word.
  • Fixed Timing: The context signal is tied to the serial position, meaning the model cannot easily account for variations in the speed of presentation or recall.

Ultimately, Burgess concludes that short-term memory isn't just a "store" of sounds, but a complex interaction between phonological information and a rhythmic, time-keeping signal.

Summary updated

Abstract

A model of short-term memory for serially ordered lists of verbal stimuli is proposed as an implementation of the 'articulatory loop' thought to mediate this type of memory (Baddeley, 1986). The model predicts the presence of a repeatable time-varying 'context' signal coding the timing of items' presentation in addition to a store of phonological information and a process of serial rehearsal. Items are associated with context nodes and phonemes by Hebbian connections showing both short and long term plasticity. Items are activated by phonemic input during presentation and reactivated by context and phonemic feedback during output. Serial selection of items occurs via a winner-take-all interaction amongst items, with the winner subsequently receiving decaying inhibition. An approximate analysis of error probabilities due to Gaussian noise during output is presented. The model provides an explanatory account of the probability of error as a function of serial position, list length, word length, phonemic similarity, temporal grouping, item and list familiarity, and is proposed as the starting point for a model of rehearsal and vocabulary acquisition.
BibTeX
@inproceedings{burgess1994solvable,
  author = {Neil Burgess},
  title = {{A solvable connectionist model of immediate recall of ordered lists}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {1994},
  url = {https://openreview.net/forum?id=HkZAeK-_-S},
}
Figure