Future Forcing: Future-aware Training-free KV Cache Policy for Autoregressive Video Generation

• URL: http://arxiv.org/abs/2605.30083v1
• Date: Thu, 28 May 2026 15:30:04 GMT
• Title: Future Forcing: Future-aware Training-free KV Cache Policy for Autoregressive Video Generation
• Abstract summary: Autoregressive (AR) video generation has emerged as a promising paradigm for long-horizon video synthesis.<n> KV cache compression methods mitigate this issue by selectively retaining only video tokens deemed important.<n>We propose Future Forcing, a training-free future-aware KV cache policy for AR video generation.
• Score: 28.305030932725884
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• BeaconKV: Key-Value Cache Compression Guided by Beacon Queries for Efficient Large Reasoning Model Inference [20.58039191111583]
  Large Reasoning Models (LRMs) achieve superior problem-solving through extended Chain-of-Thought (CoT) generation.<n>The resulting key-value ( KV) cache grows linearly with sequence length and creates severe memory bottlenecks.<n>We propose BeaconKV, a training-free KV cache compression method that maintains beacon queries, compact representatives for each global query cluster.
  arXiv  Detail & Related papers  (2026-09-04T10:23:16Z)
• Self Gradient Forcing: Native Long Video Extrapolation [60.00513917489133]
  Self Gradient Forcing restores historical context-gradient gap.<n>Code and models will be released to advance research on autoregressive video generation.
  arXiv  Detail & Related papers  (2026-07-22T16:59:23Z)
• Towards Error-Free Long Video Generation [56.86952045212838]
  In this paper, we introduce an infinite-length video generation framework that produces high-quality, dynamic, and identity-consistent single-shot long videos.<n>We first finetune a diffusion model as a video extension model on large-scale short video data to autoregressively generate temporally coherent clips.<n>Our framework establishes a new benchmark for realistic and coherent minute-level video synthesis.
  arXiv  Detail & Related papers  (2026-06-21T07:39:37Z)
• Echo-Infinity: Learning Evolving Memory for Real-Time Infinite Video Generation [59.01737077739414]
  We present Echo Infinity, an autoregressive (AR) framework towards real-time infinite video generation.<n>It employs a learnable evolving memory to dynamically filter, abstract, and compress any-length history at constant cost.<n>It achieves state-of-the-art performance, and, to our knowledge, demonstrates promising 24-hour (>1.3 M frames) real-time rollouts for the first time.
  arXiv  Detail & Related papers  (2026-06-03T07:09:01Z)
• Kwai Summary Attention Technical Report [69.40814939510126]
  Long-context ability, has become one of the most important direction of next-generation Large Language Models.<n>Standard softmax attention exhibits quadratic time complexity with respect to sequence length.<n>We propose Kwai Summary Attention (KSA), a novel attention mechanism that reduces sequence modeling cost by compressing historical contexts.
  arXiv  Detail & Related papers  (2026-04-27T12:59:53Z)
• Learning to Evict from Key-Value Cache [17.365511268829703]
  We introduce KV Policy, a framework for learning to rank tokens by their predicted usefulness for future decoding.<n> evaluated across two different model families on the long-context benchmark RULER and the multi-turn dialogue benchmark OASST2-4k.<n>Results demonstrate that learning to predict future token utility is a powerful and scalable paradigm for adaptive KV cache management.
  arXiv  Detail & Related papers  (2026-02-10T19:34:15Z)
• Past- and Future-Informed KV Cache Policy with Salience Estimation in Autoregressive Video Diffusion [53.14908419375226]
  existing approaches generally rely on KV Cache policies, which ignore differences in token importance in long-term video generation.<n>We propose a novel Past- and Future-Informed KV Cache Policy (PaFu-KV)<n>Specifically, PaFu-KV introduces a lightweight Salience Estimation Head distilled from a bidirectional cache teacher to estimate salience scores.<n>This policy yields a better quality-efficiency trade-off by shrinking KV cache capacity and reducing memory footprint at inference time.
  arXiv  Detail & Related papers  (2026-01-29T15:55:29Z)
• PackCache: A Training-Free Acceleration Method for Unified Autoregressive Video Generation via Compact KV-Cache [61.57938553036056]
  We introduce PackCache, a training-free KV-cache management method that compacts the KV cache through three coordinated mechanisms.<n>In terms of efficiency, PackCache accelerates end-to-end generation by 1.7-2.2x on 48-frame long sequences.
  arXiv  Detail & Related papers  (2026-01-07T19:51:06Z)
• Retrospective Sparse Attention for Efficient Long-Context Generation [5.562294018150909]
  RetroAttention retrospectively revises past attention outputs using newly arrived KV entries from subsequent decoding steps.<n>This breaks the fixed-attention-output paradigm and allows continual correction of prior approximations.<n>Experiments show that RetroAttention consistently outperforms state-of-the-art (SOTA) KV compression methods.
  arXiv  Detail & Related papers  (2025-08-12T15:11:47Z)
• PrefixKV: Adaptive Prefix KV Cache is What Vision Instruction-Following Models Need for Efficient Generation [97.41972925670508]
  Large vision-language models (LVLMs) incur significant computational and memory overhead during inference.<n>We present PrefixKV, where "Prefix" means the top-ranked KV based on importance rather than position in the original sequence.<n>Our method achieves the state-of-the-art performance compared with others.
  arXiv  Detail & Related papers  (2024-12-04T15:48:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.