Pith. sign in

REVIEW 1 cited by

Self-Attention Limits Working Memory Capacity of Transformer-Based Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.10715 v2 pith:CMAISTSV submitted 2024-09-16 cs.CL cs.AIq-bio.NC

classification cs.CLcs.AIq-bio.NC
keywords attentioncapacityn-backmemorymodelsworkingincreaseslimits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent work on Transformer-based large language models (LLMs) has revealed striking limits in their working memory capacity, similar to what has been found in human behavioral studies. Specifically, these models' performance drops significantly on N-back tasks as N increases. However, there is still a lack of mechanistic interpretability as to why this phenomenon would arise. Inspired by the executive attention theory from behavioral sciences, we hypothesize that the self-attention mechanism within Transformer-based models might be responsible for their working memory capacity limits. To test this hypothesis, we train vanilla decoder-only transformers to perform N-back tasks and find that attention scores gradually aggregate to the N-back positions over training, suggesting that the model masters the task by learning a strategy to pay attention to the relationship between the current position and the N-back position. Critically, we find that the total entropy of the attention score matrix increases as N increases, suggesting that the dispersion of attention scores might be the cause of the capacity limit observed in N-back tasks. Our findings thus offer insights into the shared role of attention in both human and artificial intelligence. Moreover, the limitations of the self-attention mechanism revealed in the current study could inform future efforts to design more powerful model architectures with enhanced working memory capacity and cognitive capabilities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bound by semanticity: universal laws governing the generalization-identification tradeoff

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Finite-resolution similarity functions force a universal tradeoff between identification and generalization, with a predicted 1/n collapse of multi-input capacity.

Pith tools