- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
Block-autoregressive video diffusion models generate long videos from a fixed K/V cache, and quality drifts over time. This paper traces one cause to the cache-writing pass: writing a new entry while attending to old K/V copies history into that entry, which then survives eviction long after its source is gone. The authors quantify how long such copies linger, and propose ARROW, a training-free fix. The fix is simple: keep reading the full cache while denoising, but write each entry without it, from the current and previous clean blocks only. Across three backbones this improves long-video quality and character consistency substantially (up to 29.4 points) at 5 to 17% extra time, with matched-pair ablations and a controlled intervention supporting the mechanism.
Critical strengths
(1) The paper offers a new explanation for why video quality degrades in long autoregressive generations, and the fix is simple but effective. The write step copies old cache content into new cache entries, so old mistakes survive eviction and continue to affect the video. The proposed method is simple and effective: write each entry without reading the cache. The change is training-free and brings large gains.
(2) The experiments show large and consistent gains on three models (Self Forcing on Wan2.1, MAGI-1, and HunyuanVideo-1.5), up to 29.4 points in character consistency at 5 to 17% overhead. The ablations are careful, and a controlled intervention confirms the mechanism.
Critical weaknesses
(1) The empirical results are strong, but the contribution needs to be distinguished more clearly from prior work. Writing cache entries without old K/V already exists in MAGI-1, and DSCache explicitly discusses residual influence from evicted caches. The novelty therefore lies more narrowly in the adjacent-block overlap, the decision to store only the current block’s K/V, and their analysis. The explanation of the overlap benefit is also less convincing than the results themselves.
(2) The presentation makes a simple method unnecessarily difficult to follow. For example, figure 3 combines the unchanged denoising pipeline, layer-wise cache construction, cache updates, generated examples, and diagnostic heatmaps in one overcrowded diagram. The central modification to the writer is consequently easy to miss. More broadly, the exposition should explain the concrete change and its motivation before introducing the formal analysis, and distinguish experimental findings from proposed interpretations.
Questions for authors
(1) Could you clarify the distinction from MAGI-1 and DSCache, particularly regarding context-independent cache writing and the residual influence of evicted entries? It would help to separate the novelty of the propagation analysis from that of the adjacent-pair writing rule, and explain what new insight ARROW provides beyond these precedents.
(2) Could the authors substantially improve the clarity of the method presentation? Despite the simplicity of the proposed modification, I found the explanation and figures unnecessarily difficult to follow.