Memory Forcing: Attendable Mid-Horizon History for Streaming Video Generation

arXiv:2610.11756 · cs.CV · Submitted 2026-10-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Today's paper: "Memory Forcing: Attendable Mid-Horizon History for Streaming Video Generation".

Jane: The gist: Memory Forcing is a few-step streaming method that preserves missing history without increasing the cache size by partitioning it into sink, archive, and working regions.

Tom: First, who's behind it and why it matters.

Title and authors: Tom: So we've talked about what Memory Forcing is, and now let's look at who wrote this paper and what they are trying to achieve with this approach to streaming video generation.

Jane: The paper is 'Memory Forcing: Attendable Mid-Horizon History for Streaming Video Generation', and it was written by Jiaming Zhang, Xinyu Wang, Huafeng Shi, Gangshan Wu, and Limin Wang.

Lu: These authors are coming from places like Tsinghua University and the Kuaishou Technology lab in Shanghai Artificial Intelligence Laboratory.

Meng: They’re focusing on making video generation more robust to longer sequences by dealing with that midhorizon forgetting issue we discussed earlier.

Lalam: Basically, they are trying to solve a problem where existing few-step systems usually only keep the opening and most recent frames in a fixed-size KV cache.

Tom: So what's the core idea behind their Memory Forcing method that sets it apart from what's currently out there?

Jane: The main idea is partitioning the cache into sink, archive, and working regions to retain diverse intermediate events alongside recent motion under fixed memory.

Lu: They are introducing these Archive and Working Banks to manage this partition.

Meng: When the working bank gets full, they move a chunk from working to archive using similarity as the default write into archive.

Lalam: And if the archive is full, they evict the oldest chunk by FIFO, which is a first-in-first-out strategy for removal.

The paper's summary: Tom: Let's get into what Memory Forcing actually does in detail. It’s a few-step streaming method designed to preserve missing history without increasing the cache size at all.

Jane: They address midhorizon forgetting, which is when events leave the fixed window and later frames can no longer attend to them, which is a failure we call midhorizon forgetting.

Lu: By introducing Archive and Working Banks, they partition the KV cache into sink, archive, and working regions to retain diverse intermediate events alongside recent motion under fixed memory.

Meng: The working holds recent history for local motion while the archive stores intermediate events that the working later had to give up when it became full.

Lalam: This structure ensures mid-horizon events remain attendable while local motion stays in the recent window and the cache itself doesn't grow, which is a key part of their design.

Tom: And they also have this Bank-aware RoPE mechanism to ensure that absolute temporal indices stay within the trained range by reassigning indices at attention time so each bank remains distinguishable.

Jane: That means later queries can read stored events in the right place, even if the absolute temporal indices drift outside the trained range.

The paper's improvements: Tom: Now let's talk about what they actually improved over existing methods when we compare Memory Forcing to things like Rolling Forcing or LongLive.

Jane: They show that Memory Forcing tops longer clips, dropping the least from five seconds to sixty seconds among methods reporting all four lengths.

Lu: It still retrieves leave-and-return subjects and scenes, which means consistency is maintained even when a subject leaves the immediate recent window.

Meng: And at the scale of Wan2 point 2 5B, this design scales up to produce more physically plausible, realistic, and dynamic videos.

Lalam: The contributions they point to are introducing Archive and Working Banks to keep mid-horizon events attendable, Bank-aware RoPE to reassign temporal indices, and demonstrating that the design scales to Wan2 point 2 5B.

Tom: And they show that the Archive plus working banks is actually the strongest row on Total, Quality, and Semantic scores according to Table 2a in their results <ref:2610.11756#pg1>.

Jane: They also found that Interpolated τ itp is the strongest row for Bank-aware RoPE when looking at Table 2b of their evaluations.

Conclusion: Tom: So to wrap up, Memory Forcing is a few-step streaming method for retrieving events after they leave the recent attention window. It's shown to be superior on longer clips and preserves subjects and scenes through leave-and-return.

Jane: This design scales to Wan2 point 2 5B, producing more physically plausible, realistic, and dynamic videos, and it’s to our knowledge the first public 5B model on this forcing line.

Lu: It’s a few things: Archive and Working Banks to keep mid-horizon events attendable; Bank-aware RoPE to reassign temporal indices; and demonstrating that the design scales to Wan2 point 2 5B, which is a big deal for scaling up video models.

Meng: From an engineering standpoint, the practical impact is seeing this level of detail and consistency across longer clips on a model this size.

Lalam: And for culture, having models that can generate more physically plausible and dynamic content means we get to see things that look more real in our generated media.

Tom: It's interesting work, showing how careful partitioning of the cache can solve a persistent problem in video generation systems.

State Key Laboratory for Novel Software Technology, Nanjing University

cs.CV

Submitted: 2026-10-08

Updated: 2026-10-11

Comments: 10 pages, 6 figures

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 90/100

The gist: The gist: Memory Forcing is a few-step streaming method that preserves missing history without increasing the cache size by partitioning it into sink, archive, and working regions.

Key concepts

Memory Forcing
A few-step streaming method that preserves missing history without increasing cache size. It partitions the KV cache into sink, archive, and working regions to keep important events attendable even when they leave the immediate attention window.
Archive & Working Banks
These are two banks used to partition the KV cache. The working bank holds recent history for local motion, while the archive stores intermediate events that were temporarily dropped by the working bank, ensuring diverse mid-horizon memory.
Bank-aware RoPE
A mechanism that manages temporal indices outside the trained range. It stores raw keys for the entire window and reassigns a temporal index before every attention step, ensuring that later queries can correctly read stored events.

Terminology

Summary

The gist: Memory Forcing is a few-step streaming method that preserves missing history without increasing the cache size by partitioning it into sink, archive, and working regions.

How it works

Memory Forcing addresses mid-horizon forgetting, a failure in existing few-step systems where events leave the fixed window and later frames can no longer attend to them (Page 1). It achieves this by introducing Archive & Working Banks to partition the KV cache into sink, archive, and working regions, retaining diverse intermediate events alongside recent motion under fixed memory (Page 2). The method also employs Bank-aware RoPE to ensure that absolute temporal indices remain within the trained range by reassigning indices at attention time so each bank remains distinguishable (Page 2).

The cache is managed through Algorithm 1, which dictates how new clean chunks are written into the three banks (Page 3). The sink anchors the palette and exposure, while the working holds recent history for local motion, and the archive stores intermediate events that working later had to give up (Page 3). When the working is full, a chunk is moved from working to archive using Similarity as the default write into archive (Page 3). If the archive is full, a FIFO evicts the oldest chunk by dropping it (Page 3).

Key Components and Mechanisms

The core components of Memory Forcing are defined by its partitioning strategy and temporal indexing mechanism (Page 3). The cache is split into three banks: sink, archive, and working (Page 3). The sink anchors the palette and exposure, while the working holds recent history so the tail stays continuous (Page 3). The archive holds intermediate events that working later had to give up, so mid-horizon stays diverse (Page 3).

To manage temporal indices outside the trained range, Bank-aware RoPE is introduced, which stores raw keys for the whole window and re-assigns a temporal index τ before every attention (Page 2). This allows later queries to read stored events in the right place (Page 3). The paper evaluates four assignments for how sink, archive, working, and current sit on the axis: Contiguous τ ctg keeps every index inside the trained range as one relative clip (Page 5), Collapsed τ col pins the opening shot and parks mid-horizon keys on that origin (Page 5), Stepped τ stp marks three timescales without growing indices (Page 5), and Interpolated τ itp places the archive in between with its frames distinguishable (Page 5).

Training and Scaling

Memory Forcing keeps the Rolling Forcing training recipe, its rolling schedule, and its DMD objective (Page 3). Training involves a rolling-only rollout that assembles the clean video from frames that left different noise levels (Page 4). The training mixes rolling and self-forcing windows with equal probability, while inference uses the rolling window alone (Page 4).

The method is tested on Wan2.2 5B, which begins as a bidirectional backbone and is converted into a causal student through two stages of CausalForcing (Zhu et al., 2026) (Page 7). The training involves supervising the next-frame map given clean history, ensuring that clip motion sets the target size (Page 7). The design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3).

Results and Contributions

Experiments show Memory Forcing tops longer clips, drops least from 5s to 60s among methods reporting all four lengths (Page 8). It still retrieves leave-and-return subjects and scenes (Page 8). At the 5B scale, it produces more physically plausible, realistic, and dynamic videos (Page 3). The contributions include introducing Archive & Working Banks to keep mid-horizon events attendable (Page 3), Bank-aware RoPE to reassign temporal indices, and demonstrating that the design scales to Wan2.2 5B (Page 3).

Table 2a shows that Archive plus working is the strongest row on Total, Quality, and Semantic scores (Page 9). Table 2b indicates that Interpolated τ itp is the strongest row for Bank-aware RoPE (Page 9). The overall results show Memory Forcing leads on longer clips, showing the smallest drop from 5s to 60s among methods reporting all four lengths (Page 8).

The work presents Memory Forcing, a few-step streaming method for retrieving events after they leave the recent attention window (Page 5). It is shown to be superior on longer clips and preserves subjects and scenes through leave-and-return (Page 8). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos (Page 3). It is to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). It is to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). It is to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). It is to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3). The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and to our knowledge the first public 5B model on this forcing line (Page 3).

Improvements for AI systems

  1. Improved long-clip generation by preserving mid-horizon events: Memory Forcing tops longer clips, drops least from 5s to 60s among methods reporting all four lengths. This allows for more temporally coherent and contextually rich video sequences over extended durations.

  2. Enhanced scene and subject consistency in complex scenes: The method preserves subjects and scenes through leave-and-return, meaning a subject or scene that leaves the recent window can be retrieved later, preventing identity drift observed in baselines.

  3. Scalability to larger models: The design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and, to our knowledge, the first public 5B model on this forcing line. This enables the creation of higher fidelity and more complex video content using larger foundational models.

  4. Distinguishable temporal indexing: Bank-aware RoPE reassigns indices at attention time so each bank remains distinguishable, ensuring that queries read stored events in the right place even when absolute temporal indices grow outside the trained range.

  5. Optimized cache management: The introduction of "Archive & Working Banks partition the cache into sink, archive, and working regions, where archive holds intermediate events that working later had to give up, effectively addresses mid-horizon forgetting."

Abstract

Autoregressive video diffusion enables causal video streaming without a bidirectional pass over the full clip, but existing few-step systems usually retain only the opening and most recent frames in a fixed-size KV cache. Once an event leaves this window, later frames can no longer attend to it, a failure we term mid-horizon forgetting. We present Memory Forcing, a few-step streaming method that preserves this missing history without increasing the cache size. Its Archive & Working Banks partition the cache into sink, archive, and working regions, retaining diverse intermediate events alongside recent motion under fixed memory. Because absolute temporal indices drift outside the training range, Bank-aware RoPE reassigns indices at attention time so each bank remains distinguishable. At 1.3B, Memory Forcing leads on longer clips, shows the smallest drop from 5s to 60s among methods reporting all four lengths, and preserves subjects and scenes through leave-and-return. The same design scales to Wan2.2 5B, producing more physically plausible, realistic, and dynamic videos and, to our knowledge, the first public 5B model on this forcing line.

Sources

Related papers