- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes SHARP-WAM, a bounded-context World Action Model for long-horizon robotic manipulation. It introduces learnable probe tokens to summarize historical observations and guide sparse retrieval. A fixed-capacity KV cache retains selected raw historical representations through an eviction strategy combining probe similarity and EMA-based retrieval utility. Hierarchical sparse attention then performs temporal Top-K frame selection followed by camera-aware spatial partitioning. Training combines joint video/action flow matching with sampled dense-attention routing supervision and a two-stage transition to bounded memory, while explicit video generation is omitted during inference. Experiments report 76.0% success on RMBench, 47.0% on LIBERO-Mem, and 75.0% in real-world trials, alongside bounded inference memory and per-decision latency.
Critical strengths
- A practical bounded-memory architecture.
Unlike sparse attention methods that retain an ever-growing historical cache, SHARP-WAM bounds both historical storage and retrieval costs. Retaining selected raw KV states preserves fine-grained visual information that compressed summaries may lose. The complexity analysis appropriately distinguishes constant per-decision cost from total rollout cost.
- Promising empirical results and useful ablations.
SHARP-WAM achieves strong results on memory-dependent benchmarks while maintaining competitive general-task accuracy. FIFO eviction reduces success from 80%/82% to 67%/74% on two tasks, while removing raw KV states causes larger drops. The efficiency analysis demonstrates bounded memory usage (14.5 GiB) compared with approximately 22 GiB for unbounded variants.
Critical weaknesses
- The architectural novelty relative to prior work needs clearer positioning.
MemoryWAM (Yang et al., 2026) already employs learnable gist tokens, anchor/recent memory, and a dual-DiT architecture. R-KV (Cai et al., 2025) also combines importance and redundancy for KV-cache compression, although in a different setting. SHARP-WAM's distinctive contribution lies in bounded retention of raw historical KV states with hierarchical sparse retrieval. While the raw-KV ablation supports this design, a matched-memory comparison with compressed representations would better establish its advantages.
- Insufficient isolation of individual components.
The "w/o Probe Tokens" ablation does not clearly specify the replacement mechanism for routing and eviction. Removing spatial partitioning matches or improves accuracy (80%/84% versus 80%/82%), but the corresponding latency and memory costs are not reported. Moreover, the FIFO comparison does not separately establish the contributions of similarity-based redundancy detection and EMA utility.
- Limited analysis of memory-capacity trade-offs.
Although the memory-dependent benchmarks demonstrate useful long-term retention, the paper does not systematically vary the fixed KV capacity or evaluate controlled cue-to-action delays. Figure 5 examines scalability on one task with the default 36-frame capacity. These experiments would clarify when bounded retention begins to discard task-critical historical information.
Questions for authors
Can you clarify the differences from gist-based memory approaches such as MemoryWAM? Given the raw-KV ablation in Table 4, how would SHARP-WAM compare with compressed memory representations under a matched memory budget?
What replaces probes in the "w/o Probe Tokens" ablation? Can you report the runtime impact of spatial partitioning and separately ablate similarity-based and utility-based eviction?
How do accuracy, latency, and memory change with different KV-cache capacities and increasing cue-to-action delays?