LOCI: Spatial Linear Memory for Streaming World Models

Ji Xia, Tingting Liao, Xuezhi Liang, Hao Li, Guangyi Liu

Mohamed bin Zayed University of Artificial Intelligence · Pinscreen

Published September 30, 2026 · on the feed October 2, 2026 · ▲ 11 · arXiv 2609.40222

3D, worlds & gamesModel architectureVideo Code arXiv ↗Hugging Face ↗Dataset ↗

The abstract

When a camera revisits a previously observed region, a video world model should reproduce what was there before. This requires both remembering past observations and retrieving the right one for the current viewpoint. Key-value caches preserve visual detail but grow with video length; recurrent memory is compact but compresses history into a fixed-size state, so individual past observations are no longer directly accessible. We introduce LOCI, a hybrid spatial-memory architecture that keeps both representations. In half of the transformer blocks, main attention keeps a key-value cache of past observations; in the other half, it is restricted to the current chunk and complemented by a recurrent linear-attention memory whose reads and writes are conditioned on projective camera geometry, so viewpoint enters both memory addressing and stored content. Recurrent readouts flow into subsequent cache-backed blocks and supply their queries with accumulated scene context. On the public MIND memory benchmark and on held-out recorded trajectories, LOCI reproduces revisited content more faithfully than representative world models and a same-recipe full-softmax model; with full history, it lowers peak memory at equal length by about 30% relative to full softmax. With a bounded bank of retained observations, it streams long videos at constant memory and remains more faithful than full softmax under the same budget.

The Brief

2:43

A short podcast summary of the paper. Written and voiced by AI.

Transcript

LOCI. Spatial Linear Memory for Streaming World Models. By Ji Xia and four others, from the Mohamed bin Zayed University of Artificial Intelligence and Pinscreen. Published on the thirtieth of September. Its code repository is public and real: fourteen source files.

Point a camera at a region, move away, and come back. A video world model should show what was there before. That takes two abilities: remembering past observations, and retrieving the right one for the current viewpoint. The two common forms of memory each give up one. A key-value cache keeps visual detail, but it grows with the length of the video. Recurrent memory stays compact, but it compresses history into a fixed-size state, after which individual past observations can no longer be reached directly. So one option remembers everything in detail at a cost that keeps climbing, and the other stays cheap but blurs the past together. For a model that must reproduce a specific place when the camera returns to it, neither is satisfying on its own.

LOCI is a hybrid spatial-memory architecture that declines to choose, and keeps both representations. The cache supplies detail. The recurrent memory supplies a compact running account of the scene. What makes the memory spatial is that the camera's geometry is built into how the recurrent part is read and written.

The transformer blocks are split in half. In one half, main attention keeps a key-value cache of past observations. In the other half, main attention is restricted to the current chunk, and is complemented by a recurrent linear-attention memory. That memory's reads and its writes are both conditioned on projective camera geometry, so the viewpoint shapes where things are stored and looked up, and also what is stored. The halves are connected. Readouts from the recurrent memory flow into the cache-backed blocks that follow, and give their queries accumulated context about the scene.

Tests use the public MIND memory benchmark and held-out recorded trajectories. LOCI reproduces revisited content more faithfully than representative world models, and more faithfully than a full-softmax model trained on the same recipe. With full history, it lowers peak memory by about thirty percent relative to full softmax at equal length.

A second regime matters for streaming. With a bounded bank of retained observations instead of the full history, LOCI streams long videos at constant memory, so the cost no longer grows with video length. Under that same budget it still remains more faithful than full softmax. That is the trade the problem described, a cache that grows against a state that forgets, and here the bounded version keeps memory flat without giving up faithfulness to the baseline it was compared with.

Memory for a world model, by this design, is not one mechanism but two cooperating ones. A cache keeps the detail, a camera-aware recurrent state keeps the scene, and the faithful revisit comes from letting the second inform the first.

Paper Quest · 7 chapters · about 39 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Turn the camera away, turn it back. Will the world still be there?

You are building a video world model. The camera looks at a room, wanders off, and comes back. The model should show the room exactly as it was.

The road ahead

  1. 1 · The problem ~6 min A video world model must show a place exactly as before when the camera returns, but both usual kinds of memory fail at this.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min LOCI keeps both a cache of past frames and a camera-aware compact memory, and lets the compact memory steer lookups in the cache.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Each chunk first attends locally, then reads the camera-aware memory, passes that readout on, and finally queries the cache of past frames.
  6. 6 · The experiment ~6 min You’ll guess: With full history and equal video length, how much lower was LOCI's peak memory than the full-softmax model's?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.