Project Page · arXiv 2511.12940 · ECCV 2026

Recurrent Autoregressive Diffusion: Global Memory Meets Local Attention

Taiye Chen, Zihan Ding, Anjian Li, Christina Zhang, Zeqi Xiao, Yisen Wang, Chi Jin
Peking University | Princeton University | Nanyang Technological University
Overview

Abstract

Recent advancements in video generation has shifted from bidirectional models for short videos to autoregressive ones for ultra long video generation. Previous models, which usually use sliding window attention to restrict inference cost, lack effective memory compression and retrieval for long-term generation beyond the window size, leading to issues of forgetting and spatiotemporal inconsistencies.

To enhance the retention of historical information with a fixed memory budget, we additionally incorporate temporal recurrent neural network (RNN) layers into the diffusion transformer (DiT) model. We propose a novel Recurrent Autoregressive Diffusion (RAD) framework, which leverages recurrent blocks for memory update and retrieval and preserves local details by full attention on overlapping sliding windows, with no training and inference gap.

Experiments on Memory Maze and Minecraft datasets demonstrate the superiority for long video generation by our framework with global memory and local attention. We systematically compare LSTM, Mamba2 and TTT inside RAD, and prove frame-wise overlapping sliding window achieves better spatiotemporal consistency than chunk-wise non-overlapping windows.

Core Contributions

1. Recurrent Memory in DiT

Propose RAD: insert a temporal RNN block after spatial/temporal attention in each DiT layer to build global long-term memory.

2. Frame-wise Overlapping Window

Frame-wise overlapping sliding window autoregression to maintain local pixel consistency, eliminating train-inference mismatch.

3. Hidden-State Prefetch

Hidden-state prefetch mechanism to recover parallel attention training, solving the RNN sequential training bottleneck.

4. Systematic RNN Comparison

Comprehensive comparison of LSTM / Mamba2 / TTT on long video world model benchmarks (Memory Maze, Minecraft).

Approach

Method: Recurrent Autoregressive Diffusion (RAD)

1. Overall Architecture

RAD Model Architecture

Figure 2: RAD Model Architecture — Each DiT Block contains Spatial Attention, Temporal Attention, RNN Memory Block

RAD extends standard DiT by adding an independent temporal RNN block after spatial & temporal attention in every layer:

2. Two Autoregressive Modes

Chunk-wise Autoregression (-c)

Chunk-wise Autoregression Attention Map
  • Attention windows have no overlap between chunks
  • All cross-chunk visual information must be stored in RNN hidden state
  • Works well on simple low-texture scenes (Maze), fails on complex Minecraft environment

Frame-wise Autoregression (-f)

Frame-wise Autoregression Attention Map
  • Window slides 1 frame each step, full overlapping local attention
  • Local pixel continuity transmitted via attention, RNN only stores global memory
  • Consistently better PSNR/SSIM/LPIPS on all datasets, no chunk boundary artifacts

3. Hidden State Prefetch (Parallel Training)

Prefetch vs Standard Sliding Window Training

Figure 4: Prefetch vs Standard Sliding Window Training

Vanilla RNN blocks force sequential training and break attention parallelism. We precompute all RNN hidden states on clean frames in stage 1; stage 2 runs full parallel attention denoising with pre-fetched memory states.

Algorithm 1: Inference Pipeline of Frame-wise RAD
Require: Context video $\mathbf{x}_{1:T_c}$, target length $T$, RAD layers of attention and RNN block $\{A_d,R_d\}_{d=1}^D$, window size $C$, denoising steps $K$
  1. $\mathbf{v}_{out}\leftarrow \mathbf{x}_{1:T_c}$
  2. Initialize hidden states $\{h^d\}_{d=1}^D$
  3. # Prefill hidden states from context
  4. For $d=1$ to $D$DiT layer
  5. $h_0^d\leftarrow\mathbf{0}$
  6. For $t=1$ to $T_c-C+1$Frame sequence
  7. $\mathbf{z}_t^d\leftarrow A_d(\mathbf{x}_t)$
  8. $h_t^d\leftarrow R_d(\mathbf{z}_t^d,h_{t-1}^d)$
  9. EndFor
  10. $h^d\leftarrow h_{T_c-C+1}^d$
  11. EndFor
  12. # Sliding window with 1-frame stride
  13. While $|\mathbf{v}_{out}|< T$Frame sequence
  14. Sample $\epsilon\sim\mathcal{N}(0,\mathbf{I})$
  15. $\mathbf{z}\leftarrow \mathrm{cat}(\mathbf{v}_{out}[-C+1:],\epsilon)$
  16. For $k=1$ to $K$Denoising step
  17. For $d=1$ to $D$DiT layer
  18. $\mathbf{z}^d\leftarrow A_d(\mathbf{z})$
  19. $\mathbf{z},\hat{h}^d\leftarrow R_d(\mathbf{z}^d,h^d)$
  20. EndFor
  21. $\mathbf{z}\leftarrow \mathrm{DenoiseStep}(\mathbf{z},k)$
  22. EndFor
  23. $h^d\leftarrow \hat{h}^d,\ d=1,\dots,D$Clean hidden state
  24. $\mathbf{v}_{out}\leftarrow\mathrm{Append}(\mathbf{v}_{out},\mathbf{z}_{-1})$
  25. EndWhile
Return $\mathbf{v}_{out}$
Algorithm 2: Training Pipeline of Frame-wise RAD
Require: Clean video $\mathbf{x}$, target $\mathbf{v}_{gt}$, sequence length $T$, RAD layers $\{A_d,R_d\}_{d=1}^D$
  1. Initialize hidden bank $\mathbf{H}\leftarrow\emptyset$
  2. # Prefetch hidden states with 1-frame RAD
  3. For $d=1$ to $D$DiT layer
  4. $h_0^d \leftarrow \mathbf{0}$
  5. For $t=1$ to $T$Frame sequence
  6. $\mathbf{z}_t^d \leftarrow A_d(\mathbf{x}_t)$
  7. $h_t^d \leftarrow R_d(\mathbf{z}_t^d,h_{t-1}^d)$
  8. $\mathbf{H}[d,t]\leftarrow h_t^d$Clean state
  9. EndFor
  10. EndFor
  11. # Train RAD on full sequence
  12. $\mathbf{z}=\mathbf{x}+\epsilon,\ \epsilon\sim\mathcal{N}(0,\mathbf{I})$
  13. For $d=1$ to $D$DiT layer
  14. $\mathbf{z}^d\leftarrow A_d(\mathbf{z})$Parallel attention
  15. $\mathbf{z}\leftarrow R_d(\mathbf{z}^d,\mathbf{H}[d,:])$Parallel RNN
  16. EndFor
Return $\mathrm{MSE}(\mathbf{z},\mathbf{v}_{gt})$

4. RNN Module Comparison (LSTM / Mamba2 / TTT)

Module FLOPs Params Chunk-wise Performance Frame-wise Performance
LSTM O(BHWL(dh+h²)) 195M Best Strong
Mamba2 O(BHWLdn) 153M Poor Comparable
TTT-linear O(BHWL(d²+C)) 118M Poor Comparable

LSTM separates short-term hidden output yₜ and long-term cell state Cₜ, which makes it superior when attention cannot cross chunk boundaries. With overlapping frame-wise windows, three RNN variants perform nearly identically.

Qualitative Results

Video Visualization Results

Each sample shows a 4×2 grid: the top row is chunk-wise generation and the bottom row is frame-wise generation, each compared across the Mamba2, TTT, and LSTM recurrent modules, alongside the shared ground-truth reference.

Rows: chunk-wise (top) · frame-wise (bottom) Columns: Mamba2 · TTT · LSTM · Ground Truth
Quantitative Results

Experimental Results

Datasets & Evaluation Metrics

1. Memory Maze Quantitative Results

Model RNN Type PSNR SSIM LPIPS
DF None 14.73 0.32 0.51
VRAG None 15.55 0.41 0.43
RAD LSTM-c 15.64 0.43 0.47
RAD LSTM-f 15.50 0.41 0.45

2. Minecraft Quantitative Results

Model RNN Type PSNR SSIM LPIPS
DF None 15.65 0.45 0.53
VRAG None 16.11 0.49 0.50
RAD LSTM-c 14.24 0.39 0.55
RAD LSTM-f 16.59 0.46 0.46

3. Computational Resource Analysis

RNN Block GPU Mem (GB) Train Step Time (s) Params (M)
LSTM 10.0 3.7 195
Mamba2 11.1 3.6 153
TTT 16.0 12.9 118

TTT has severe training speed overhead; LSTM achieves balanced memory and runtime cost despite larger parameter count. Prefetch stage overhead only accounts for ~17.5% total FLOPs.

Analysis

Ablation Studies

1. Clean vs Noised Memory Frames for RNN

Memory Input PSNR SSIM LPIPS
Noised Latent Frames 14.70 0.38 0.52
Clean Frames (Ours Prefetch) 15.30 0.41 0.50
Training loss curve

Feeding denoised noisy latents into RNN damages memory encoding; clean frame prefetch is critical for stable long-term memory.

2. Partial Overlap Chunk Ablation

Mode Window Stride PSNR SSIM LPIPS
LSTM-c Full Chunk 20 15.64 0.43 0.47
Partial Overlap 10 15.06 0.40 0.55
LSTM-f Frame-wise 1 15.50 0.41 0.45

Partially overlapping windows cannot reach performance of full frame-wise stride=1 sliding attention.

Reference

Citation

@misc{chen2025recurrentautoregressivediffusionglobal,
      title={Recurrent Autoregressive Diffusion: Global Memory Meets Local Attention}, 
      author={Taiye Chen and Zihan Ding and Anjian Li and Christina Zhang and Zeqi Xiao and Yisen Wang and Chi Jin},
      year={2025},
      eprint={2511.12940},
      archivePrefix={arXiv},
      primaryClass={cs.CV},
      url={https://arxiv.org/abs/2511.12940}, 
}