Rafhael Oliveira · IA

Consulted memory: a bank of abstract states read by attention

What summed memory does not do, the piece LeCun describes, and the vector index that makes it viable on disk.

1 min read· chapter: 9 min· Experiment in progress · chapter updated on 12 Sept 2026

Landed here from LinkedIn? This is chapter 14 of the experiment Antivision · Latent Rehearsal. It reads on its own; if you want the beginning, it is chapter 00.

Summed memory persists, but dilutes: the whole past is worth less than each half alone. Chapter 11 measured it: long memory errs 0.181, recent-only memory errs 0.173. Summing the past into a vector is losing what you sum. LeCun asks for something else: a consulted memory, which survives the window and the session. Here it becomes a bank of abstract states read by attention, with a vector index quantised to 4 bits: 128 bytes per state instead of 1,024, a million blocks in 128 MB. The run that measures whether attention chooses from the whole past instead of diluting it is in the queue.

The three points

  1. What the sum does not do: the whole past is worth less than each half. Attention over a bank chooses instead of diluting.
  2. Why a vector index: a million blocks fit in 128 MB at 4 bits, with SIMD search and incremental persistence. Attention uses only the k retrieved, in fp32.
  3. How to read the run: the bank passes if 'long' beats 'recent' and 'empty' stays neutral. If the gain is zero, the next step is a longer past, not another piece.

From the chapter, the beginning

Chapter 11 measured that a memory vector persists, but dilutes: the whole past is worth less than each half. LeCun asks for something else — a memory that is consulted, and survives the window and the session. Here it becomes a bank of abstract states read by attention, with a quantized vector index (turbovec) keeping the bank on disk.

The memory of chapter 11 is one vector m per sequence, updated at every block that leaves the window: m ← m + f([m ; sblock]). It persists — prediction with the memory of the right text gains +0.019 over the memory of another text, even a whole window later. But the same table showed the limit: "long" (A+B) errs 0.181, worse than "recent" (B only, 0.173) and than "old only" (A only, 0.174). A vector of fixed capacity does not accumulate: each new block overwrites part of the previous one. The more past, the less of each piece.

LeCun describes another piece. The talk: "you may have to combine this with the content of a memory to get a complete idea of the state of the world". The interview: systems with "persistent memory, of the type that we have". And the architecture slide has the memory as a module consulted by the world model, not as a running sum. Chapter 11 left this written as an open question: "the consulted memory, not just summed, requires attention over a bank of abstract states, and is another piece". This is the piece.

Keep reading chapter 14 →Ler em portuguêsThe PDFs by e-mail →
What the chapter covers · 5 sections · 9 min
  1. What the summed memory does not do
  2. The piece: bank + attention
  3. Why a vector index, and why turbovec
  4. The round
  5. On the bench
All chapters of the experiment · Antivision · Latent Rehearsal
  1. 00 · Antivision: an ELLM, a language model that rehearses in latent space before speaking
  2. 01 · The custom tokenizer: why 16 thousand tokens suit this corpus better than 50 thousand, and what the whole table shows
  3. 02 · Two architectures, one file: the fair duel between 2019 and what came after
  4. 03 · The geometry of the embedding: training starts with a perfect space and ruins it
  5. 04 · The lineage of collapse: five answers from computer vision, each measured on text
  6. 05 · The rudder and the world model: three versions of the same question, each measured against the last
  7. 06 · Method and mistakes: the rules of a legitimate comparison and the catalogue of our own errors
  8. 07 · Scale and budget: what it costs to reach GPT-3, and why VRAM is almost never the limit
  9. 08 · The workbench: serve, x-ray and train from the browser
  10. 09 · The hierarchical architecture: the whole project aligned to the four patterns of the world model
  11. 10 · What JEPA is, according to LeCun: two talks read concept by concept, and where each one applies
  12. 11 · Memory and horizon: two claims from LeCun that became experiments, and both hold for text
  13. 12 · Learned costs and inference modes: the three searches and the two sources of energy, measured
  14. 13 · The corrections from LeCun's talks: failure, passage, flag, measurement
  15. 14 · Consulted memory: a bank of abstract states read by attention
  16. 15 · What it costs and what it delivers: us, GPT-1 and GPT-2 on the only ruler valid across tokenizers
  17. 16 · The minimum was off the list: the day I measured my own search by energy
  18. 17 · ELLM: the right name for a language model that predicts in latent space and decides by energy
  19. 18 · Searching better does not fix the energy: three searches, the same text
  20. 19 · The inversion that did not repeat: the world model's cost appears once the ruler stops swinging
  21. 20 · What changed on 17/09: two new chapters and two corrections

Before this: the GPT-2 course

Rafhael Oliveira
Rafhael Oliveira

Writes the GPT-2 course and runs the Antivision experiment, measuring every run before publishing the number. The LinkedIn posts start here and end in the chapters.

Follow on LinkedIn →