Memorizon: Training World Models Beyond Their Context Window
Tingting Liao, Xuezhi Liang, Hao Li, Guangyi Liu
MBZUAI
Published September 30, 2026 · on the feed October 2, 2026 · ▲ 11 · arXiv 2610.00544
The abstract
Streaming world models should render a place consistently across repeated visits. Directly supervising such revisits requires training samples that capture both visits, often spanning minutes. Yet dense attention over the full span incurs quadratic costs, making long-span supervision expensive. Memorizon breaks this coupling: long spans are needed for supervision, but not for attention, since the two visits can share a forward pass without including every intervening frame. A training sample covers a span of any length but is scored only on its last k chunks. Instead of tokenizing the history before them, each scored chunk retrieves its own top-K latents by camera co-visibility, and the union of these requests forms a shared bank. The bank is bounded by kK, so the sequence stays bounded however long the span; at the shortest span the recipe is exactly conventional training. Adding the bank raises the cost of a step once; beyond that, a longer span costs little, and going from 100 to 400 s adds 12% to the step time. Against a sliding-window baseline, retrieval raises revisit consistency on every split, and a span long enough to reach the first visit of each return adds a further 24% to 30%, at some cost in image quality; beyond that span, more length no longer helps. Filling the bank from another episode lowers revisit correlation by 83%, so the model uses what it retrieves. Project page: https://tingtingliao.github.io/memorizon
The Brief
2:34A short podcast summary of the paper. Written and voiced by AI.
Transcript
Memorizon. Training World Models Beyond Their Context Window. By Tingting Liao and three others, from MBZUAI. Published on the thirtieth of September. Its code repository is public and real: sixteen source files.
A streaming world model should render a place consistently each time it comes back to it. Walk away from a room and return, and the room should look the way it did. Supervising that directly means training on samples that contain both visits, and the two visits are often minutes apart. Dense attention over the full span between them incurs quadratic cost, so supervising long spans becomes expensive very quickly. The length needed for supervision and the length paid for in attention have been tied together, and the longer the revisit, the worse the bill.
Memorizon breaks that coupling. Its premise is that long spans are needed for supervision, but not for attention. The two visits can share a forward pass without including every frame that came between them. So a training sample may cover a span of any length, but it is scored only on its last k chunks, and only those chunks need to see the earlier visit.
Rather than tokenizing the whole history before those chunks, each scored chunk retrieves its own top K latents, chosen by camera co-visibility. In other words, it pulls back the earlier latents whose camera views overlap its own. The union of those requests forms a shared bank. The bank is bounded by k times K, so the sequence stays bounded however long the span grows. At the shortest span, the recipe is exactly conventional training, which means the method extends ordinary training rather than replacing it.
Cost behaves as designed. Adding the bank raises the cost of a training step once. Beyond that, a longer span costs little: going from one hundred seconds to four hundred seconds adds twelve percent to the step time. Against a sliding-window baseline, retrieval raises revisit consistency on every split. A span long enough to reach the first visit of each return adds a further twenty-four to thirty percent, at some cost in image quality. Past that span, extra length no longer helps.
A control checks that the bank is really being used, and is not just extra compute. Filling it from a different episode lowers revisit correlation by eighty-three percent. If the retrieved memories come from the wrong place, the consistency falls apart, so the model does rely on what it retrieves.
Two lengths that are usually one have been pulled apart. How far back the supervision reaches can stretch to minutes, while what the model attends to in a single step stays fixed in size. That separation is how training reaches beyond the context window named in the title, and the point where extra span stops paying off marks how far it is useful to reach.
Paper Quest · 7 chapters · about 41 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
Every quest starts with a wall. Here it is a room that should look the same when you return, and a training bill that grows with every second away.
You train a video world model that streams frames as a camera moves. Walk away from a room and come back, and the room should look as it did.
The road ahead
- 1 · The problem ~7 min A world model must redraw a place the same way when the camera returns, but training clips are too short to hold both visits.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min A long span is needed to supervise a revisit, not to attend over it, so only the needed past frames enter the sequence.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Draw a span, let each scored chunk retrieve its own matching latents, merge them into one bank, and compute the loss on the scored chunks only.
- 6 · The experiment ~6 min You’ll guess: Once the retrieval bank is in place, how much does stretching the training span from 100 to 400 seconds add to step time?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.