- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes DRAM, a fixed-size recurrent memory module for pretrained robot policies with frozen backbones. It combines frame-wise joint delta-rule updates, patch-level historical retrieval, and flexible policy integration. LIBERO experiments across two backbones, integration and memory-reset tests, and real-robot evaluations demonstrate improved success, particularly on longer manipulation tasks.
Critical strengths
Practical integration with pretrained policies. DRAM adds persistent, fixed-size memory while keeping the vision/VLM backbone frozen. Improvements across both DiT and π0.5 support its usefulness beyond a single policy architecture.
Evidence of benefit on multi-stage manipulation. The real-world full-task success rate improves from 0% to 85% over 20 trials per setting, alongside gains on LIBERO-10. These results support the practical value of historical context for extended manipulation.
Critical weaknesses
The central memory design is not isolated experimentally. Comparisons mainly establish gains over no memory; they do not isolate joint delta-rule writing, read-before-write, or patch-level access against matched alternative memory modules. This leaves unclear whether the proposed mechanism offers benefits beyond adding recurrent capacity.
The efficiency claim lacks empirical support. Fixed-size state bounds storage with episode length, but each update requires a per-head, per-layer matrix solve. Without measured latency, memory usage, and control throughput, the practical advantage over other history-conditioning approaches remains unsubstantiated.
Questions for authors
Clarification: Under matched backbone, training, and parameter budgets, how does DRAM compare with simpler recurrent memory and sequential delta-rule updates? What evidence attributes the gains specifically to frame-synchronous joint writing rather than additional capacity?
Clarification: What are DRAM’s measured inference latency, memory overhead, and control frequency relative to the backbone alone and alternative memory modules, including the per-layer Cholesky solves?
3 comments
Response to Reviewer 9gea (Weakness 2 and Question 2)
W2 & Q2. What are DRAM’s measured inference latency, memory overhead, and control frequency relative to the backbone alone and alternative memory modules, including the per-layer Cholesky solves?
A2. We evaluate the the inference overhead of pi0.5 and pi0.5 + DRAM over historical window , the main overheads of DRAM integrated is arised in cholesky solve in all DRAM layer, which introduce extra 35ms of compuation overhead, also, for action expert, extra memory tokens raise the action expert inference cost by 10%. However, comapring to the just packing a fixed window of history frame into VLM, the DRAM inference obverhead is much less than naive approach and reatin the constant computation overhead across the entire trajectories. We use first 10 steps from action chunks, so without inference optimization the control speed is about 6.25Hz. For this computation overhead, even without highly inference optimization, the inference cost of pi0.5 with DRAM could be covered by using technique like RTC (real time chunking).
| Stage / Metrics | pi0.5 | pi0.5 | pi0.5 + DRAM | pi0.5 + DRAM |
|---|---|---|---|---|
| H | 1 | 32 | 1 | 32 |
| VLM (ms) | 43.45 | 4421.03 | 43.25 | 43.75 |
| DRAM (ms; includes Cholesky solves in all layers) | — | — | 35.83 | 35.80 |
| Action Expert (ms) | 72.22 | 166.69 | 80.11 | 80.09 |
| Full Path Overhead (ms) | 115.68 | 4594.82 | 159.19 | 159.64 |
| Peak GPU memory(GiB) | 9.00 | 58.38 | 10.23 | 10.24 |
| Presistent memory state (MiB) | 0 | 0 | 9.00 | 9.00 |
Code Release and Kind Request for Further Discussion
Dear Reviewer 9gea,
Thank you again for your thoughtful review. As a further update, we have anonymously released our model inference code at https://anonymous.4open.science/r/DRAM-5ABC/, along with the model weights for RMBench.
As the discussion period draws to a close, we would greatly appreciate the opportunity for further discussion. If you have any remaining questions or concerns, we would be happy to discuss them with you at any time.
Response to Reviewer 9gea (Weakness 1 and Question 1)
W1 & Q1. Isolated comparisons of joint delta-rule writing , read-before-write, and patch-level access against matched alternative memory modules. What evidence attributes the gains specifically to frame-synchronous joint writing rather than additional capacity?
A1. Thank you for your question. We have added comparisons of DRAM with simpler recurrent memory mechanisms (Pooled Gated Recurrent Unit(GRU) Memory and Recurrent Memory Transformer(RMT)), DRAM sequential delta-rule writing (Sequential Write), and an adapter without history (Stateless Adapter) on RMBench under the same setting to better isolate the contributions of DRAM’s design choices.
Each variant is evaluated over 100 episodes per task across nine tasks, totaling 900 episodes. The group success rate averages follow RMBench's M(1) and M(n) partition.
The results show that DRAM outperforms other variants in most of the situations, directly demonstrates the advantages of DRAM. Specifically, DRAM exceeds the tested stateless adapter and pooled GRU by 45.11 and 33.78 percentage points, respectively. Against DRAM (seq. write), it improves overall success by 4.00 points. The difference is concentrated in M(n), which improves from 53.00% to 67.00%. DRAM (seq. write) performs better on M(1), at 56.80% versus 52.80%; we report this task-group dependence explicitly.
We further emphasize that for comparison of DRAM (seq. write) and DRAM, the setup is aligned to frame-level decay with no further human bias. The sequential and joint variants share the memory architecture, parameter count, state dimensions, readout interface, and frame-level retention parameterization. Both apply retention once before writing the frame. While the FLA sequential kernel receives a zero tokenwise log-decay input, so it adds no further multiplicative token-retention gate. Its successive delta corrections remain order-dependent. Joint writing fits all frame associations together. This comparison examines the implemented joint-write operators; it does not identify serialization order as the sole explanation for their performance difference.
The following table shows that neither the simple recurrent mechanism nor parameter capacity really contributed to the success rate on RMBench. For the stateless adapter, it is basically equivalent to adding more parameters to the action expert, but it still performs poorly. Also, for pooled GRU, it applies a recurrent mechanism, but the parameter capacity is not enough to capture long-term history. The RMT experiment provides a clearer illustration of the issue: the RMT ablation has higher parameter capacity, the same number of memory tokens, and the same history-state size, but it still performs worse than our DRAM.