Autoregressive video diffusion models have become a leading approach to real-time interactive video generation and video world modeling. However, existing methods typically allocate computation uniformly across space when generating the next video chunk, updating all patches with the same denoising schedule and number of function evaluations. This ignores the spatial heterogeneity of video content: static, simple, or recurring regions are often easier to denoise, while other regions require further refinement or additional context. A uniform budget thus leads to redundant computation on easy patches, whereas reducing the fixed step count can leave difficult patches insufficiently refined. We introduce \methodname{}, a general framework that dynamically allocates denoising steps to individual patches: easy patches stop early to improve efficiency, while difficult patches receive more refinement steps. This design accelerates generation with negligible quality degradation. Our method is compatible with most existing few-step autoregressive diffusion models, requiring only a lightweight routing module with modest training. Experiments demonstrate that \methodname{} reduces the total number of denoising steps applied across video patches by about 50% while maintaining visual quality comparable to the four-step baseline.
Figures & tables
Figure 1: ForcingBooster accelerates interactive video generation and world model by adaptively allocating different denoising steps to different patches. Heatmap overlays visualize router allocations from matching conditional samples: static backgrounds need fewer updates than moving objects, new regions or detailed textures.
Figure 2: Adaptive patch-wise inference and on-policy router training. (a) The router selects patches to continue denoising; stopped predictions provide reusable KV context. (b) A no-gradient rollout records exits for replay. Reconstruction and computational costs train the router through its stopping probabilities.
Figure 3: Denoising steps required by different patches. Left: fixed-step generation results with enlarged local details. Right: patch-wise first-hit step distribution at 35dB PSNR relative to the four-step reference in a separate controlled experiment.
Figure 4: Qualitative comparison. The rows show the results from four-step baseline to one-step sampling, and ForcingBooster. One-step and Two-step sampling exhibits a decline in quality and visible artifacts. Red boxes indicate visual artifacts.
Method
Quality ↑
Semantic ↑
Total ↑
Time (s) ↓
Speedup ↑
NFE Reduction ↑
1 step
83.06
69.50
80.35
7.08
1.58×
64.29%
2 steps
83.69
71.66
81.29
8.67
1.29×
42.86%
3 steps
84.24
71.96
81.78
9.78
1.14×
21.43%
4 steps (baseline)
84.54
72.21
82.08
11.15
-
-
ForcingBooster
83.88
72.20
81.55
8.56
1.30×
50.19%
Table 1: Comparison on Causal Forcing checkpoint. Time includes generation through VAE decoding. Speedup and denoising patch-NFE reduction are relative to each model’s four-step baseline.
Base model
Quality ↑
Semantic ↑
Total ↑
Speedup ↑
Wan2.1 14B (1 step)
82.10
71.35
79.95
1.96×
Wan2.1 14B (2 step)
84.71
77.93
83.35
1.29×
Wan2.1 14B (4 steps)
84.96
78.04
83.57
-
Wan2.1 14B + ForcingBooster
84.73
77.65
83.32
1.31×
LingBot-World-V2 14B (1 step)
78.79
69.72
76.98
1.98×
LingBot-World-V2 14B (2 step)
80.13
71.65
78.43
1.36×
Table 2: Results on additional world model and interactive video generation methods. Speedups include VAE decoding and are relative to each model’s four-step baseline. All methods use four steps for the first chunk.
Figure 5: Qualitative comparison across additional models. ForcingBooster produces visual results comparable to the four-step baseline, while uniform one-step sampling often exhibits a decline in quality and visible artifacts. Red boxes indicate visual artifacts.
Figure 8
Figure 7: Router analysis. (a) Effect of the computational cost weight λnfe . (b) Effect of the stopping threshold η , with a separate router trained for each threshold and the same threshold used at inference. Both panels report LPIPS against the four-step output and normalized full-video runtime; lower is better.
Can autoregressive video diffusion be accelerated further when only four denoising steps remain? Existing feature caching approaches struggle in this regime, as large feature changes between denoising timesteps undermine both direct reuse and lightweight predictors. We observe that features across video chunks remain strongly correlated at matching denoising timesteps, offering a complementary source of guidance. Building on this insight, we introduce TGuide, a framework that accelerates autoregressive video diffusion through a lightweight Anchor-Transport-Correct (ATC) predictor guided by historical sampling trajectories. Our ATC combines two complementary references: the current chunk's preceding-step features preserve its spatial structure, while the previous chunk's same-timestep features provide information at the target denoising stage. By integrating these references through spatial retrieval and adaptive correction, ATC improves velocity prediction accuracy despite the large gaps between denoising steps. To mitigate error accumulation across both denoising steps and video chunks, we train the predictor on its own autoregressive rollouts, allowing it to adapt to states shaped by its own earlier predictions. An optional confidence-aware scheduler further adjusts the quality-efficiency trade-off. Experiments on Self Forcing, Causal Forcing, and HY-WorldPlay show that TGuide preserves generation quality while achieving denoising speedups of up to 1.89× over the original 4-step generators. On Self Forcing, TGuide generalizes from 81-frame training videos to 333-frame generation, approximately four times the training length, while exceeding the original model's VBench score.
Zhuo Chen, Bin Zou, Fanyue Wei +3
University of Electronic Science and Technology of China · University of Hong Kong · National University of Singapore
Video diffusion transformers have achieved state-of-the-art visual quality, but their high inference cost remains a major bottleneck for real-time applications. Recent distillation frameworks produce autoregressive video diffusion models with reduced latency, yet these models still use a fixed number of denoising steps per frame, wasting computation on predictable frames and under-refining challenging ones. We present DSA, a confidence-guided adaptive computation framework for AR video diffusion. DSA introduces a lightweight confidence head, trained jointly with the generator under a distribution-matching distillation objective, to estimate per-frame denoising reliability. At inference, this confidence signal dynamically adjusts the number of diffusion steps: simple frames terminate early for speed, while complex frames receive additional refinement. Our method requires no extra video data, no heuristics, and little architectural modification. Experiments show that DSA achieves real-time autoregressive video generation, reaching 22.63 FPS with sub-second latency on H100 GPUs, while maintaining competitive or superior VBench quality compared to recent autoregressive and bidirectional video diffusion models. Our results demonstrate that confidence-guided adaptive sampling provides an effective and practical path toward interactive video generation.
Thanh-Tung Le, Yunhan Zhao, Menglei Chai +5
University of California, Irvine · Google · Google DeepMind
Recent progress in large-scale generative models has substantially advanced video generation, yet existing methods remain constrained by a rigid inference paradigm. Bidirectional diffusion models excel at global coherence and visual fidelity but suffer from slow inference, while autoregressive models offer efficient and streaming generation at the cost of long-range consistency and exposure bias. We introduce Flex-Forcing, a unified training and inference framework that enables a video diffusion model to seamlessly operate under both bidirectional and autoregressive generation regimes. The core idea is a flexible chunking mechanism jointly defined over the temporal axis and denoising steps. This design allows the model to (1) perform flexible chunking according to different device budgets, (2) perform bidirectional inference across chunks for global structure planning, while generating frames autoregressively within each chunk for efficient and fine-grained synthesis, and (3) perform any-order, any-timestep autoregressive generation without the strict causal constraint. Extensive experiments on multiple video generation benchmarks demonstrate that Flex-Forcing achieves consistently better video quality, long-video stability than strong baselines with a rigid inference schedule, while offering faster inference.
Xinyin Ma, Julius Berner, Chao Liu +3
Electrical and Computer Engineering, National University of Singapore, Singapore · NVIDIA Research, California, USA