提出无需训练的未来感知缓存策略,提升长视频生成一致性
Future Forcing: Future-aware Training-free KV Cache Policy for Autoregressive Video Generation

- 基于历史统计预测未来查询分布,实现无训练的未来感知决策
- 在60秒长视频生成中,主题一致性提升1.49分(VBench-Long)
- 适合需要高效长序列生成的视频模型开发者
自回归(AR)视频生成已成为长时序视频合成的有前途范式,每帧生成依赖先前生成的标记。为加速推理,使用KV缓存避免重复计算,但其随生成长度增长导致内存占用上升和误差累积,限制了模型扩展性。现有缓存压缩方法通过保留重要视频标记缓解此问题,但多依赖短期信号判断重要性,易忽略早期看似不重要但对后续帧至关重要的标记。本文发现:尽管经RoPE调制的查询随生成步骤演变,但原始查询分布保持高度稳定。这一近似平稳性表明,可通过历史统计估计未来查询分布,从而实现无训练的未来感知缓存决策。基于此,提出Future Forcing——一种无需训练的未来感知缓存策略:先从历史统计构建未来查询代理,再据此评分缓存标记,最后在由未来查询诱导的仿射子空间内合并冗余标记对。大量实验表明,该方法在有限缓存下显著提升长时序一致性,在60秒生成任务上于VBench-Long上实现1.49分的主题一致性提升。
原文摘要 · Abstract (English)
Autoregressive (AR) video generation has emerged as a promising paradigm for long-horizon video synthesis, where each frame is generated conditioned on previously generated tokens. To accelerate inference, the KV cache is used to avoid redundant recomputation across generation steps. Nevertheless, its growth with generation length introduces increasing memory and error accumulation, limiting the scalability of AR models to even longer sequences. Existing KV cache compression methods mitigate this issue by selectively retaining only video tokens deemed important. However, most existing methods assess token importance using short-horizon signals derived from the current or historical generation context, making these methods prone to overlooking tokens that appear unimportant at early steps but later become critical for future frames. In this work, we identify an important property of trained AR video models: although RoPE-modulated queries evolve across autoregressive steps, the underlying canonical pre-RoPE query distribution remains remarkably stable throughout the video generation process. This approximate stationarity implies that future query distributions are estimable from historical statistics, enabling principled future-aware cache decisions without any additional training. Building on this insight, we propose Future Forcing, a training-free future-aware KV cache policy for AR video generation. Specifically, Future Forcing first constructs a future query proxy from historical statistics, then scores KV cache tokens by their importance under this proxy, and finally merges redundant token pairs within the affine subspace induced by the future query. Extensive experiments show that Future Forcing improves long-horizon consistency under limited KV caches, achieving up to 1.49 improvement in subject consistency on VBench-Long for 60s generation over existing AR video KV cache policies.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。