- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper investigates the historical KV memory requirements of streaming VLA policies and opportunities for compression. It identifies a confound in LingBot-VA: reducing the attention window also shrinks cache capacity, allowing current predictions to evict useful history. The authors independently control window size, cache capacity, and history retention, supported by token-level tracing and ablations on historical content and recency. Experiments on LIBERO-Long and three RoboTwin tasks show that retaining one or two recent chunks can preserve task success. Combining short retention with simulated asymmetric KV quantization yields approximately 25× storage-equivalent compression of historical KV memory, although actual packed-cache memory savings are not measured.
Critical strengths
- The paper shows that reducing the attention window can also shrink cache capacity, causing current predictions to evict historical tokens. Controlled experiments and token-level traces substantiate this explanation. This contribution improves the validity of memory evaluations and cautions against interpreting small-window performance collapse as evidence that long histories are necessary.
- Retention, recency, content, and quantization ablations show that a small recent cache can preserve performance on the evaluated tasks. Matched warm-up controls and paired comparisons strengthen these findings. The results provide concrete guidance for reducing historical KV storage while distinguishing explicit cache requirements from the information already encoded in retained representations.
Critical weaknesses
- The central retention results are established on LingBot-VA using LIBERO-Long and three RoboTwin tasks. The additional FastWAM experiments address quantization rather than history retention. The evaluation also lacks a setting where longer explicit history demonstrably improves performance. Consequently, the conditions under which short retention becomes insufficient remain unclear, limiting the broader applicability of the conclusions.
- The approximately 25× historical KV compression is a storage-equivalent calculation: the quantization experiments dequantize values back into a BF16 cache rather than implementing packed low-bit storage. Although this limitation is clearly disclosed, the experiments do not establish the actual memory savings or runtime trade-offs of the proposed cache configuration. Since the quantization strategy largely follows existing methods, this implementation gap limits the demonstrated practical contribution beyond the paper’s diagnostic findings.
Questions for authors
- The native implementation evicts individual slots, whereas the controlled implementation retains whole chunks; numerical equivalence is established only before eviction. What evidence separates the effect of cache capacity from the change in eviction behavior after eviction begins? Does any existing comparison hold eviction behavior fixed while varying capacity?
- How is the nominal window parameter translated into the attention mask in the controlled implementation? In the fixed recent-2, 1,152-slot sweep, which historical tokens are actually accessible at versus ? If the retention rule already determines the effective read set, what independent role does play in this comparison?