- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
AdaMem learns to maintain a bounded episodic memory for a frozen EventVLA policy using counterfactual future-action losses. AdaMem-Select performs raw-frame admission and replacement, while AdaMem-Full additionally introduces compression, temporally ordered merging, and gated latent-memory integration. Experiments on eight RoboTwin-MeM tasks report improved success rates and reduced resource usage over heuristic memory-management baselines.
Critical strengths
- The paper addresses a practical problem: preserving task-relevant historical evidence under limited memory budgets.
- Counterfactual action supervision provides a task-oriented criterion for memory selection, and the raw-frame Select variant helps isolate its benefit.
- Closed-loop evaluations, component ablations, and fixed-event replay provide complementary evidence of improvements within the EventVLA setting.
Critical weaknesses
-
Limited novelty beyond EventVLA. The method inherits EventVLA’s policy and event-proposal pipeline, with the main contribution being a learned memory-maintenance component. Although useful, the paper does not convincingly establish a substantial conceptual advance over existing memory selection, compression, and gated-reading mechanisms.
-
Insufficient analysis of related work. The related-work section largely lists existing methods without clearly explaining AdaMem’s technical distinctions. The authors should include an analytical comparison with relevant approaches such as NativeMEM and Gated Memory Policy. This discussion is necessary to clarify which aspects of AdaMem constitute new contributions beyond existing memory-augmented policies.
-
Evaluation is limited to very small memory capacities. The experiments restrict memory capacity to . It remains unclear whether AdaMem retains its advantage over methods that efficiently maintain much longer histories under the same computational and storage budgets. The paper should analyze this trade-off and clarify whether the reported gains primarily reflect better management of a small memory bank or a broader advantage in memory efficiency.
-
Incomplete attribution of the Full variant’s gains. AdaMem-Full introduces trainable compression, merging, and reading modules alongside learned management. A baseline using the same representation and reader with heuristic management is needed to distinguish better memory decisions from additional modeling capacity.
-
Narrow validation scope. Evaluation is restricted to one benchmark and one policy backbone. The short-window action-loss proxy and finite-candidate regret bound do not establish reliable long-term memory management across tasks or architectures.
-
Presentation needs improvement. Text in Figure 2 is too small to read comfortably. Figures 3 and 4 leave substantial whitespace around their content; improving the layout would allow larger labels and clearer visualization.
Questions for authors
- How does AdaMem-Full compare with heuristic management when the compressor, merger, and latent reader are held identical?
- How sensitive are the gains to the future-action supervision horizon and the delay between storing evidence and using it?
Reply to Reviewer Vehd
Thank you for asking what this work teaches beyond adding a memory module.
1. Contribution Beyond EventVLA — W1
The central insight is that event salience and write value are different quantities. A frame can be salient in isolation yet redundant with the current bank; admitting it can displace unique earlier evidence needed later. AdaMem learns to evaluate complete post-update banks via the frozen policy's future action loss rather than independent frame scores. At K=3, raw-only
AdaMem-Selectgets 692/800 vs. 661/800 (KEM-score) and 647/800 (Raw-FIFO) without adding Full's modules, and bank scoring improves Full over independent scoring (721/800 vs. 672/800). The contribution is this task-supervised write formulation, not new compression, merging, or gating primitives.2. Relation to NativeMEM & Gated Memory Policy — W2
We will expand Section 2 to compare both works:
3. Fixed-Module Attribution (
KEM-Fullvs.AdaMem-Full) — W4, Q1Holding trained (Cϕ,Gϕ,Rω), candidate generator, repair, budgets, and 800 scenes fixed at K=3:
Raw-FIFOAdaMem-SelectKEM-FullAdaMem-FullKEM-Fullsums S(m)=∑e∈E(m)sKEM(e)/∣E(m)∣ with deterministic tie-breaking (raw slots, depth, timestamps, index). With the compressor, merger, reader, and candidate-update machinery held fixed, replacing KEM-based selection with learned action-utility selection improves success from 679/800 to 721/800 (+5.25 percentage points) (+16 onOrdered Object Picking, +26 on the other seven tasks). This supports a contribution from the selection rule within the trained Full system, beyond the mere presence of compression and reading modules. It does not establish that action-utility guidance is necessary for compression to be beneficial, nor equal compute or separate representation retraining (aggregate rates and marginal Wilson CIs reported without an unverified paired test).4. Small Banks vs. Long Histories — W3
Across K∈{1,2,3,5}, Full beats FIFO by +181, +135, +74, and +63 episodes out of 800. In our evaluated EventVLA B3 configuration, each raw memory frame contributes 256 visual tokens (increasing FIFO from K=3 to 5 raises context from 768 to 1,280 tokens and latency from 42.1 to 56.4 ms on RTX 4090). We remove any implication of strict token/byte matching across Select and Full at equal K and scope our claim to managing tested small banks rather than larger-K or long-history compressed policies.
5. Horizon, Scope & Readability — Q2, W5, W6
Offsets {1,2,4,8} index future policy queries for write labeling rather than memory expiration, though cues needed after offset 8 receive no direct credit at admission. Retraining window sweeps, controlled cue-to-use delay tests, and cross-backbone/benchmark transfer remain open; we also do not present hypothetical traces as observed logs. Eq. (11) is a single-step proxy proposition under a uniform error assumption not instantiated by empirical MAE, not a return guarantee. We will enlarge Figure 2 labels, crop whitespace in Figures 3–4, add distinct markers/line styles/direct labels in Figure 4, and keep schematics labeled as schematics.
Given that the fixed-module
KEM-Fullexperiment directly isolates the +5.25 percentage-point gain of action-utility selection beyond representation modules—alongside our clarified positioning relative to NativeMEM and Gated Memory Policy—we kindly ask you to reconsider your assessment and raise your score.