- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
NanoKV compresses historical KV caches for autoregressive video generation while keeping the backbone frozen. It combines shared-center residual coding, joint head–channel compression, and separate fitting objectives for Keys and Values. NanoKV-Fast adds mixed-dimensional attention using the same compressed representation. Experiments on three backbones show lower KV storage and peak GPU memory, with higher reference PSNR than the evaluated compression baselines.
Critical strengths
(1) The memory savings are convincing. On HY-WorldPlay, NanoKV reduces KV storage from 20.96 GiB to 0.80 GiB and peak allocated GPU memory by 35.9%. It also improves PSNR over KVTC by 1.0 dB while using roughly half its KV storage. Similar storage improvements are reported on the other two backbones. Including metadata and resident operators in the storage accounting makes these results useful for assessing deployment costs.
(2) The core compression scheme is straightforward. Shared centers capture common features, leaving the low-dimensional coefficients to encode token-specific residuals. The separate treatment of Keys and Values is sensible given their different roles in attention, and the ablation results show that the main components contribute to the final performance.
Critical weaknesses
(1) The evaluation leaves the behavior over longer generation unclear. The three backbones are evaluated on videos of 253, 169, and 125 frames. The quality-over-time plots are useful, but do not establish how the method behaves over much longer rollouts or repeated scene revisits. This matters particularly for NanoKV-Fast, whose gap from NanoKV grows later in generation. Longer tests are needed to assess how much quality is lost as compression errors propagate.
(2) The practical benefit depends on cache length, but this dependence is not measured. The main results use fixed history settings, including 32 historical latent frames for HY-WorldPlay. With a smaller sliding window, resident codec storage and encoding/decoding costs may account for a larger share of the total cost. The latency results already show limited gains: NanoKV is slower than the uncompressed reference, while NanoKV-Fast reaches only 1.06×, 1.04×, and 0.98× its speed across the three backbones. A cache-length sweep would clarify when the memory savings remain worthwhile and whether the additional computation pays off.
Questions for authors
(1) The evaluation covers three action-conditioned video models. Could you also evaluate NanoKV on a text-conditioned autoregressive model without explicit action inputs, such as LongLive, including minute-long rollouts? This would help assess whether the benefits extend beyond action-conditioned models and persist over longer generation.
(2) Table 2 adds Key block-output alignment after shared centers and Value quantization-aware fitting. Could you also apply Key alignment directly to the Joint PCA + INT4 baseline, keeping the coefficient dimensions, quantization, calibration data, and Key-training budget unchanged? Comparing this configuration with the full method would show how much the other two components contribute once Key alignment is present. Ablations removing each component from the full method would help separate their individual contributions.
(3) Could you evaluate smaller history windows, using the same window length and history-selection policy across methods? Please report quality, effective KV compression, peak GPU memory, and end-to-end latency. At what window sizes do NanoKV and NanoKV-Fast retain a useful advantage over uncompressed caching and the compression baselines?
4 comments
Response to Reviewer vjCw (Part 2)
Q1: Short and minute-long text-conditioned generation on LongLive
Response. To test applicability beyond action-conditioned models, including minute-long generation, we evaluated LongLive without explicit action inputs on 40 held-out prompts. We generated 165- and 969-frame videos, the latter approximately one minute. Both lengths used the native 12-latent-frame window and the same offline-fitted codecs, with the backbone frozen.
PSNR, SSIM, and LPIPS use the corresponding Original reference; VBench follows the paper's protocol. KV + codec includes cached data and resident codec storage; effective compression is Original's KV storage divided by this total. AR peak measures allocated GPU memory during autoregressive generation, whereas time is end to end. Results on an A800 are below:
| Rollout length (frames) | Method | PSNR ↑ | SSIM ↑ | LPIPS ↓ | VBench ↑ | KV + codec (MiB) ↓ | Effective compression ↑ | AR peak memory (GiB) ↓ | End-to-end time (s) ↓ |
|---|---|---|---|---|---|---|---|---|---|
| 165 | Original | — | — | — | 0.8665 | 3290.63 | 1.00× | 7.25 | 35.23 |
| 165 | NanoKV | 23.02 | 0.7069 | 0.1850 | 0.8631 | 185.35 | 17.75× | 4.32 | 37.40 |
| 969 | Original | — | — | — | 0.8576 | 3290.63 | 1.00× | 7.32 | 169.69 |
| 969 | NanoKV | 16.01 | 0.6051 | 0.3032 | 0.8524 | 185.35 | 17.75× | 4.40 | 190.11 |
As shown above, the same codec provides 17.75× effective compression and lower AR peak memory at both lengths, while keeping VBench close to Original. Reference fidelity decreases with rollout length, but inspected videos retain largely intact subjects and scenes without obvious deformation. These results support applicability to text-conditioned generation through minute-long rollouts. We have added the results and visual comparisons in revised Appendix E.7, Table 26 (p. 33) and Figure 15 (p. 34).
Q2: Key alignment on Joint PCA + INT4 and component removal
Response.
1. Key alignment without shared centers or Value fitting. To separate Key alignment's contribution from the preceding components in Table 2, we applied it directly to Joint PCA + INT4. We used Table 2's 20 samples and compression configuration, keeping coefficient dimensions, quantization, calibration data, and Key-training budget unchanged. Results are below:
| Configuration | PSNR ↑ | SSIM ↑ | LPIPS ↓ | VBench ↑ |
|---|---|---|---|---|
| Joint PCA + INT4 | 16.38 | 0.4953 | 0.4077 | 0.7753 |
| Joint PCA + INT4 + Key alignment | 18.12 | 0.5809 | 0.2654 | 0.8212 |
| Full NanoKV | 20.20 | 0.6692 | 0.1968 | 0.8171 |
As shown above, Key alignment improves all four metrics even without shared centers or Value fitting. The full method further improves PSNR, SSIM, and LPIPS, showing that the other components remain useful when Key alignment is present.
2. Leave-one-component-out ablation. To isolate each component's contribution within the full method, we removed shared centers, Value fitting, or Key alignment individually, retaining the other components and using the same samples and compression configuration as Table 2. Results are below:
| Configuration | PSNR ↑ | SSIM ↑ | LPIPS ↓ | VBench ↑ |
|---|---|---|---|---|
| Full NanoKV | 20.20 | 0.6692 | 0.1968 | 0.8171 |
| Without shared centers | 18.58 | 0.6019 | 0.2411 | 0.8208 |
| Without Value fitting | 20.17 | 0.6653 | 0.1988 | 0.8171 |
| Without Key alignment | 18.54 | 0.5839 | 0.2922 | 0.8007 |
As shown above, shared centers and Key alignment are the main contributors to reference fidelity in this setting: removing either causes larger losses than removing Value fitting. This agrees with the additive ablation in Table 2. We have added these ablations in revised Appendix E.1, Tables 16–17 (p. 28).
While NanoKV improves efficiency for short video generation, I remain concerned about its performance on longer videos and its generation quality under text-only conditioning. Nevertheless, I acknowledge its substantial memory savings. Taking both these benefits and the remaining limitations into account, I will maintain my current rating.
Thank you for your continued evaluation and constructive feedback. We appreciate your recognition of NanoKV's memory savings and understand your remaining concerns. Your suggestions have helped us improve the paper and clarify its scope and limitations.
Response to Reviewer vjCw (Part 1)
We thank the reviewer for recognizing the storage savings and the rationale of our compression design. PDF revisions are marked in red.
W1: 509-frame generation and repeated scene revisits
Response. To examine error accumulation over longer rollouts and the growing gap between NanoKV-Fast and NanoKV, we extended Table 2's 20 samples from 253 to 509 frames with two out-and-back camera cycles. We kept a 32-latent-frame history window and used a same-length Original reference. PSNR, SSIM, and LPIPS measure fidelity to Original; VBench follows the paper's quality evaluation. Full-sequence results are below:
As shown above, NanoKV's full-sequence VBench remains close to the same-length Original, while NanoKV-Fast has lower reference fidelity and VBench. To determine whether these quality losses worsen later in generation, we compared early and late segments (frames 1–252 and 253–508), including Original's own quality change. Results are below:
As shown above, reference fidelity declines later for both compressed methods, with a larger decline for NanoKV-Fast. NanoKV's VBench decline is close to Original's, while NanoKV-Fast's is larger. This indicates accumulating compression deviations and a greater late-stage quality cost from NanoKV-Fast's additional approximation. Visual inspection of revisits shows that both retain the main subjects and scene content, with local deformation more pronounced in NanoKV-Fast. We have added these results and examples in revised Appendix E.6, Tables 24–25 (p. 32) and Figure 14 (p. 33).
W2 / Q3: Quality, storage, and latency across history windows
Response. To test whether compression remains worthwhile when resident codec costs become more prominent at smaller windows, we swept HY history windows of 8/16/32/48 latent frames on Table 2's 20 samples. Each rollout has 253 frames; methods use the same history-selection policy within each window and its corresponding Original reference.
Storage includes cached KV and resident representations; effective compression divides Original's KV storage by this total. Peak memory and total time are measured end to end. Results are below:
As shown above, NanoKV retains better quality and effective compression than KVTC at all tested windows, including window 8. At window 8, all compressed methods share the same memory peak because text-prompt encoding, before history KV exists, determines that peak.
For latency, standard NanoKV remains slower than Original. NanoKV-Fast is faster than Original at windows 16/32/48 and faster than KVTC at every tested window. Thus, small-window storage savings remain useful, but speed gains depend on window size.
Shorter history is not always preferable: it limits information available for generation and may affect quality and scene memory. NanoKV primarily targets applications requiring longer history. We have added this sweep in revised Appendix E.5, Table 22 (p. 31).