- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes SRoME, which compresses video history using a pretrained video VAE and large-patch tokenization, then feeds the resulting tokens into VLA or WAM policies with block-causal attention and KV caching. Validation includes RoboMME task evaluations, a patch-size ablation, and synthetic training/inference scaling measurements demonstrating reduced history-token counts and computational costs.
Critical strengths
The representation is simple and token-efficient: video compression followed by large-patch packing substantially reduces history-token counts, with timing measurements supporting computational savings over the implemented MEM baseline.
Critical weaknesses
Limited methodological novelty and attribution. The method combines existing video compression, large-patch packing, and causal caching. Without a matched no-history baseline, the experiments do not establish whether gains arise from the proposed memory representation or the WAM’s additional capacity and future-image supervision.
Long-horizon capability is not demonstrated. Extended-context results measure computation on synthetic inputs with history already cached, excluding prefill and cache updates. Task evaluation remains confined to RoboMME, with only 24.25% overall success. These results do not substantiate reliable long-duration memory or practical end-to-end deployment.
Questions for authors
NA