- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
FrameFold is a training-free KV cache consolidation method for AR video generation. It merges adjacent historical entries by evaluating how well the merged representations preserve the original attention responses, then greedily selects the merges that introduce the least change. Experiments show improved video consistency and visual quality under fixed cache budgets, with further improvements in continuous eight-minute generation.
Critical strengths
1. The paper is well organized, with a clear presentation of the motivation, method, and experiments. The figures also help explain the proposed approach and make the paper easy to follow.
2. The long-horizon experiments are valuable. Testing continuous generation for up to eight minutes shows that the benefits extend beyond short clips, with FrameFold maintaining good consistency and visual quality as the video gets longer.
Critical weaknesses
1. The paper shows that FrameFold can achieve better video quality with a smaller KV cache, but reducing the number of cache entries does not necessarily translate into the same reduction in overall GPU memory usage. The actual memory savings are therefore unclear.
2. FrameFold reduces the cache size by introducing additional steps to evaluate candidate merges and update the cache. These operations also incur computational and memory costs, which are not fully quantified in the paper.
Questions for authors
1. Could the authors report the actual GPU memory usage and computational costs compared with the baselines under different cache budgets? This would help clarify how much the reduced cache size translates into practical memory and computation savings.
2. Could the authors provide a breakdown of the additional latency and memory overhead introduced by candidate evaluation, value fitting, and iterative cache updates? This would help better understand the overall cost of FrameFold.
3 comments
Thank you for the detailed responses. The additional experiments and analyses have addressed most of my concerns.
Although the methodological novelty is somewhat limited, I find the proposed approach practically useful for long-video generation, and the experimental results on video quality are convincing.
I have two minor suggestions:
- I encourage the authors to include more efficiency-related evaluations and analyses in the main paper to provide a more comprehensive understanding of the practical benefits and costs of FrameFold.
- Please check the figure references and overall formatting. In particular, Figure 2 is cited before Figure 1 in the Introduction, and Figure 3 could be explicitly referenced when introducing the overall framework in Section 4.
If these suggestions are addressed, I would be willing to increase my rating to 3.
Thank you for the follow-up and for your careful review and constructive suggestions.
We have revised the manuscript to address both suggestions:
-
Efficiency evaluations and analyses. We added Section 5.5 (pp. 9–10) to the main paper. It reports peak allocated GPU memory and throughput across cache budgets, the latency and memory overhead relative to FIFO at the same budget, and the main latency components within FrameFold. Appendix A.9 provides the detailed profiling protocol, operation-level breakdown, and comparison of serial and batched candidate evaluation. These additions clarify both the practical benefits of reducing the cache budget and the additional costs of consolidation.
-
Figure references and formatting. The Introduction now cites Figure 1 before Figure 2. We also explicitly reference Figure 3 in Section 4.1 when introducing the two coupled decisions underlying our framework. We checked the remaining figure and table references and reviewed the overall formatting.
Changes are highlighted in blue to help locate the revisions.
(W1 & Q1) GPU memory and computational cost.
Thank you for highlighting the distinction between KV-cache capacity and actual runtime memory consumption.
For a fixed current-chunk size, a larger historical KV cache increases both GPU memory consumption and the computational cost of self-attention, reducing generation throughput. Maintaining a smaller cache can therefore improve generation efficiency and facilitate deployment on memory-constrained consumer GPUs. FrameFold aims to preserve useful historical information within this smaller budget through cache consolidation.
To quantify these practical benefits, we report generation-stage peak allocated GPU memory and throughput after cache saturation across cache budgets:
Reducing the cache budget from 21 to 12 entries decreases KV storage by 42.9%, reduces measured peak GPU memory by 32.8%, and increases throughput by 49.9%. These measurements demonstrate that a smaller cache translates into practical memory and throughput benefits, while distinguishing cache-storage savings from the reduction in total runtime memory.
Peak allocated memory is recorded using
torch.cuda.max_memory_allocated(), including generator weights, caches, activations, and temporary allocations during denoising and cache consolidation. Throughput is reported as output-equivalent FPS after cache saturation. Text-encoder and VAE weights remain on the CPU; text encoding, VAE decoding, and video saving are excluded.(Q2 & W2) Additional latency and memory overhead.
Thank you for requesting this breakdown. At a cache budget of 12, FrameFold adds 305.7 ms per chunk relative to FIFO, a 16.5% latency increase. We compare complete chunk generation after cache saturation. Each chunk contains three latent frames, with four denoising forwards and one clean refresh at t=0. Timings exclude text encoding, VAE decoding, and video saving.
The additional 305.7 ms represents 14.1% of FrameFold’s total chunk latency. At the operation-category level, the net overhead can be expressed as
$
ΔT=TFF−TFIFO=Teval+Tfit+(TupdateFF−TupdateFIFO)$
where evaluation and fitting are introduced by FrameFold, while the cache-update contribution is the difference between the two methods’ maintenance costs.
We separately profile three non-overlapping categories within FrameFold:
For memory, a separate single-GPU measurement at budget 12 gives peak allocated memory of 14.889 GB for FrameFold versus 10.149 GB for FIFO, an increase of approximately 4.74 GB (46.7%).
Our implementation evaluates candidate pairs in parallel. At each greedy merge iteration, �3� eligible historical entries form �4� adjacent pairs, whose independent attention computations are batched for parallel evaluation. Compared with evaluating these pairs serially, this reduces candidate preparation and evaluation time from 548.2 to 223.0 ms/chunk, yielding a 2.46× speedup (59.3% latency reduction) for this component.
We will include these measurements and the explicit profiling boundaries in the revised paper.