- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents SemanticKV, a training-free method for KV Cache compression in autoregressive video generation. It compresses the KV cache by discarding entries that are not strongly attended by the selected keyword text tokens. The authors provided comparisons with other baseline methods on Causal Forcing, Self Forcing, Longlive, and Longlive 2.0 to demonstrate the effectiveness of SemanticKV.
Critical strengths
- The paper addresses a meaningful problem in AR video generation: KV cache compression. As the video length grows, the KV cache should be sensibly managed to control the computational budget.
- Core code is provided in the supplementary material to enhance reproducibility.
Critical weaknesses
- Inaccurate and incremental contributions: a) The paper spent too much space describing the agentic AR video generation framework in Section 3. However, it is mostly unrelated to the methodology section, except for the extraction of semantic constraints R. The authors should consider substantially reorganizing the paper's framing to highlight the real contribution. b) The paper's method can be described as retaining the most attended KV entries by the selected keyword tokens, which has been explored by previous works. In addition, the method also has no significant relation to agentic generation.
- Insufficient experimental results: a) The authors did not provide any video results. In addition, the qualitative results in the appendix remain limited. It is rather hard to assess the real performance of video generation methods without substantial video results. b) Agentic workflows play a more important role in long video generation than in generating short clips. However, there is no comparison with other baseline methods except Full KV, which is critical in the experiments.
Questions for authors
Did the authors apply the agentic AR video generation framework to all baseline methods? This should be explicitly stated to ensure fair comparisons, since the original prompts seem to be very short in the appendix.
2 comments
Response to Reviewer PGTo (Part 2/2)
W2(b) b) Agentic workflows play a more important role in long video generation than in generating short clips. However, there is no comparison with other baseline methods except Full KV, which is critical in the experiments.
We agree that evaluating long-video generation in an agentic workflow calls for comparing cache policies within that same workflow. We therefore added 30- and 60-second comparisons with Dummy Forcing and Forcing-KV on LongLive 2.0. All three methods share the planner and critic, use the same 128 MovieGen prompts and five seeds, and retain 8,448 KV slots per layer.
Under these conditions, SemanticKV preserves the subject’s appearance across successive clips more consistently than Forcing-KV, with a 3.97-point advantage at 60 seconds. We also measured within-clip quality by aggregating six VBench dimensions on two-second clips. SemanticKV exceeds Dummy Forcing on this measure by more than one point at both durations.
| Metric | Duration | SemanticKV | Comparator | Gain (points) |
|---|---|---|---|---|
| Cross-clip subject consistency | 30 s | 83.64 | Forcing-KV (80.10) | +3.54 |
| Cross-clip subject consistency | 60 s | 78.16 | Forcing-KV (74.18) | +3.97 |
| Within-clip score | 30 s | 79.66 | Dummy Forcing (78.31) | +1.35 |
| Within-clip score | 60 s | 78.84 | Dummy Forcing (77.81) | +1.04 |
Section 5.5 reports the paired within-clip score differences against both compressed baselines and Full KV, with 95% confidence intervals. Appendix I gives the scores before differencing.
Q1 Did the authors apply the agentic AR video generation framework to all baseline methods? This should be explicitly stated to ensure fair comparisons, since the original prompts seem to be very short in the appendix.
Yes. Within each backbone, all five policies use the same cached plan, original and rewritten prompts, two-candidate generation protocol, and critic selection. We used this common plan to regenerate candidates whose saved plans differed and replayed the affected selections. The short captions show the original benchmark prompts. For example, Appendix I records both the original input “a white car” and its saved rewrite and exclusions. The same planner fields are used for every method.
For SemanticKV, a seed-matched rewrite raises independent constraint satisfaction by 3.94/3.37 points at 30/60 seconds, and critic selection adds 2.44 points at both lengths over a uniform choice from the same pair. All five methods benefit from selection. Section 5.5 and Appendices B.2 and I make the shared workflow and the cache-policy comparisons explicit.
Response to Reviewer PGTo (Part 1/2)
Thank you for asking us to clarify the contribution of the cache policy, the comparison protocol, and the qualitative evidence for long-video generation.
We agree that the link from Section 3 to the cache policy should be explicit. The revised opening of Section 3 states that the planner, generator, and verifier define the shared workflow and points directly to the constraint-conditioned query selection in Section 4.1. The planner produces constraints and a rewritten prompt. The generator uses the prompt for synthesis, and SemanticKV uses the constraints to determine which visual queries guide cache retention. Section 5.5 evaluates that cache policy under the common workflow.
Thank you for pointing out the connection between SemanticKV and prior attention-based eviction methods. We agree that using observed attention to identify history worth retaining has precedents. Two distinctions are relevant here.
Section 2 of the revision discusses the connection to prior work. Sections 3 and 4.1 explain how the planner’s output determines query selection and grouping.
Thank you for pointing out the limited qualitative examples in the original submission. We added two matched frame comparisons in Appendix I. Figure 13 shows frames from 30-second videos generated by five methods, and Figure 14 shows their 60-second results for the same scene. Both figures use the same original prompt and seed 42. We selected the first MovieGen prompt in hash order among those with at least three constraints, independently of generation scores.
The prompt describes a young woman driving a car, with a blurred green forest visible through a rainy window. Each row shows one method at five equally spaced times, with the columns aligned across methods. Reading across a row shows how the subject and background appear at successive sampled times. Reading down a column lets the reader compare how the methods depict the same scene requirements.