- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
FAME-VLA augments pretrained VLA policies with two complementary memory branches: a causal Transformer encoding the observation history and a persistent initial-scene memory queried by current visual features. Their outputs condition the action expert through zero-initialized adaptive normalization. Episode-wise history sharing avoids repeatedly encoding overlapping prefixes. Experiments on RMBench and three physical manipulation tasks show substantial improvements, supported by ablations of memory branches, spatial pooling, conditioning mechanisms, and history length.
Critical strengths
- The paper is clearly motivated: it equips VLA models with a lightweight yet comprehensive representation of historical context to support long-horizon robotic execution. In addition, the manuscript is well written, and the figures and tables are clearly presented and easy to follow.
- With π₀, success increases from 7.11% to 64.89% on RMBench and from 10.00% to 71.67% on physical tasks. Results with StarVLA further support applicability across different policy implementations.
- Action-expert modulation incorporates history without expanding VLM inputs. Causal episode-wise encoding provides a sensible way to share computation across supervised timesteps while preserving observation causality.
Critical weaknesses
- The experimental evaluation is limited in both simulated and real-world settings. The proposed method is evaluated on only nine tasks from RMBench and three real-world tasks, which does not provide sufficiently broad evidence to substantiate its effectiveness and generalizability. The authors are encouraged to conduct additional evaluations on established simulation benchmarks, such as LIBERO, CALVIN, RoboTwin, and RLBench, as well as on a more diverse set of real-world tasks.
- All three real-world tasks are relatively simple and short-horizon, and therefore do not adequately demonstrate the effectiveness of the proposed historical-memory mechanism, particularly for the long-horizon execution setting that motivates this work. In addition, the real-world evaluation includes an insufficient number of baseline methods, making it difficult to assess the relative effectiveness of FAME-VLA under practical deployment conditions. More comprehensive comparisons with representative VLA and memory-augmented approaches on the same real-world tasks are needed.
- Incorporating historical memory into VLA models is conceptually intuitive and easy to understand. However, the manuscript lacks sufficiently thorough comparative analysis in two respects. First, it does not compare the proposed method against a baseline that directly incorporates the complete sequence of historical images, in terms of both task performance and computational efficiency. Such a comparison is necessary to clarify whether the proposed memory mechanism offers meaningful advantages over simply retaining the full visual history. Second, the paper lacks an in-depth comparison with existing memory-centric VLA methods, such as MemoryVLA, OptimusVLA, and Mem-0. For example, how does FAME-VLA perform relative to these memory-based baselines across the evaluated benchmarks? More importantly, how does its memory construction differ from existing approaches, and what are the specific methodological innovations beyond prior work?
Questions for authors
As noted in the weaknesses, the reviewer recommends expanding the evaluation to include additional benchmarks and real-world tasks, incorporating a broader set of baseline methods, and providing more in-depth comparisons with existing memory-centric VLA models.
5 comments
W3_1: Comparison with Direct Frame Stacking
We agree that direct history concatenation is an important baseline. We evaluate an 8-frame π₀ variant across all nine RMBench tasks and a 4-frame variant on Put Back Block, Swap T, and Cover Blocks. Both variants concatenate main-camera frames sampled at 1 s intervals, together with two current wrist-camera views, using the same pretrained initialization and action objective as vanilla π₀. All variants use 50 expert demonstrations and 100 evaluation rollouts per task.
| Task | π₀ | π₀ + Multi-frame (8) | π₀ + FAME |
|---|---|---|---|
| Observe and Pick Up | 8% | 7% | 1% |
| Rearrange Blocks | 10% | 2% | 97% |
| Put Back Block | 16% | 13% | 81% |
| Swap Blocks | 8% | 0% | 98% |
| Swap T | 13% | 5% | 96% |
| Battery Try | 9% | 2% | 40% |
| Blocks Ranking Try | 0% | 0% | 91% |
| Cover Blocks | 0% | 3% | 79% |
| Press Button | 0% | 0% | 1% |
| M(1) average | 11.00% | 5.40% | 74.60% |
| M(n) average | 2.25% | 1.25% | 52.75% |
| Overall average | 7.11% | 3.56% | 64.89% |
| Task | π₀ + Multi-frame (4) | π₀ + Multi-frame (8) |
|---|---|---|
| Put Back Block | 13% | 13% |
| Swap T | 3% | 5% |
| Cover Blocks | 1% | 3% |
| Average | 5.67% | 7.00% |
Computational cost. Increasing the input from 4 to 8 frames raises peak GPU memory from 34.41 to 48.26 GiB and nearly doubles training time per update . Given these costs, we could not evaluate direct concatenation of the complete observation history within our computational budget and therefore used bounded-history baselines.
Task performance. The 8-frame baseline achieves 3.56% average success across all nine tasks, compared with 7.11% for vanilla π₀ and 64.89% for π₀ + FAME. On the three-task subset, the 4-frame and 8-frame variants achieve 5.67% and 7.00%, respectively, compared with 9.67% for vanilla π₀. Thus, increasing the directly concatenated history incurs higher training costs without improving average success over vanilla π₀ .
FAME encodes history through a dedicated memory module without extending the VLM input sequence, enabling full-history conditioning within our training resources. The results support its effectiveness relative to the tested direct-input baselines. We will include these performance and cost measurements, the baseline configurations, and the scope of this comparison in the revised manuscript.
W3_2: Comparison with Existing Memory-Augmented VLA Methods
-
MemER uses a high-level VLM to select historical keyframes and predict subtasks for a separately fine-tuned VLA. Training requires subtask annotations and semi-automatically generated keyframe supervision.
-
Mem-0, in its hierarchical configuration, combines a planner retaining completed-subtask descriptions and boundary observations with an executor using anchor and sliding-window memory. The models are trained separately with subtask supervision and coordinated through a subtask-end classifier.
-
HAMLET augments pretrained VLAs with moment tokens and temporal memory. Moment tokens are initialized through time-contrastive learning before policy fine-tuning; in its GR00T N1.5 configuration, the VLM and moment tokens remain frozen during fine-tuning.
-
MemoryVLA retrieves historical information from a perceptual–cognitive memory bank and uses gated fusion to condition a diffusion action expert. Similar adjacent entries are merged when the bank reaches capacity.
-
OptimusVLA[2] retrieves demonstration trajectories to construct global action priors and models action history for local consistency. Training comprises VLA pretraining, prior-retrieval learning, and local-memory learning.
FAME combines three complementary properties:
-
Full-history conditioning with persistent initial-scene memory. FAME causally encodes the complete observed history while retaining a separate branch for initial spatial details, without relying on explicit keyframe selection or subtask-boundary detection.
-
A modular adapter for pretrained action policies. FAME retains the pretrained backbone and action expert, injecting memory through layer-wise modulation without extending the VLM input sequence or adding a separate planner. We demonstrate this adaptation on both π₀ and StarVLA. While HAMLET also supports pretrained-policy adaptation, FAME combines it with full-history and initial-scene memory learned in a single stage.
-
Joint memory learning through the original action objective. Action supervision jointly optimizes spatial aggregation, temporal memory, and policy-adaptation parameters, without additional keyframe or subtask annotations or a separate contrastive initialization stage.
Our RMBench comparisons includes Mem-0, MemER, HAMLET, and MemoryVLA, using matched budgets of 50 demonstrations and 100 evaluation rollouts per task. FAME achieves average success rates of 64.89% with π₀ and 56.11% with StarVLA, compared with 42.00% for Mem-0 and 41.78% for MemoryVLA. Because these methods differ in backbone and pretraining, we also independently train and evaluate π₀, StarVLA, and their respective FAME variants under the same protocol, retaining the same pretrained initialization within each pair. These comparisons assess the benefit of adding FAME to each backbone. Our comparison with OptimusVLA is methodological.
We will expand the manuscript to include these methodological distinctions, supervision requirements, and baseline configurations alongside the empirical comparisons.
[1] Chen, Tianxing, et al. "RoboDojo: A unified sim-and-real benchmark for comprehensive evaluation of generalist robot manipulation policies." arXiv preprint arXiv:2607.04434 .
[2] Li, Zaijing, et al. "Global prior meets local consistency: Dual-memory augmented vision-language-action model for efficient robotic manipulation." arXiv preprint arXiv:2602.20200 .
We thank the reviewer for the careful evaluation and constructive suggestions. Below, we present additional experiments, clarify the scope of our evaluation, and provide more detailed comparisons with direct frame stacking and existing memory-augmented VLA methods.
W1:Additional Evaluation Benchmark
To extend our experiments beyond RMBench, we conducted additional evaluations on three memory-dependent tasks from RoboDojo [1]. We selected these tasks because they directly test the capability targeted by FAME: using historical information to make decisions when the current observation alone is insufficient.
For each task, we initialize FAME-VLA from π₀-base and fine-tune it on 100 demonstrations. We evaluate a fixed checkpoint over 50 rollouts per evaluation seed across three seeds, giving 150 rollouts per task. The complete-task success rates, averaged across evaluation seeds, are reported below. We also include EventVLA [3], a keyframe-based memory-augmented VLA, as an additional reference.
π₀ + FAME achieves nonzero success on all three tasks, with higher observed success rates than the published π₀ leaderboard results. As FAME augments an existing VLA with historical context, absolute task success also depends on the underlying policy’s perception and manipulation capabilities. The RoboDojo results provide additional evidence of FAME’s applicability to memory-dependent tasks beyond RMBench.
We will include these additional results, task descriptions, and evaluation details in the revised manuscript.
W2: Real-World Task Horizons and Evaluation Scope
We report episode-length statistics over 50 expert demonstrations per task, with durations calculated at 15 Hz:
Swap Blocks averages nearly one minute, with the longest demonstration lasting 85.67 seconds. Beyond duration, these tasks require historical information: Press Button involves tracking repetitions, Put Back Block requires recalling an earlier object location, and Swap Blocks requires tracking progress and object–location correspondence. Although the manipulation primitives are simple, visually similar observations can require different actions depending on history.
Our real-world evaluation tests whether FAME enables a pretrained VLA to use historical information to complete memory-dependent tasks on a physical robot. With the same π₀ backbone, adding FAME improves success on all three tasks, raising average success from 10.00% to 71.67% and supporting this capability under physical deployment.
Real-robot deployment code for some competing methods is not publicly available, and we were therefore unable to reproduce their deployment on our platform. We acknowledge that the current evaluation remains limited in task diversity and baseline coverage, and does not establish superiority over other memory-augmented methods on physical robots. We provide complementary quantitative comparisons on RMBench in W3_2 and will clarify this evaluation scope alongside the episode-length statistics in the revised manuscript.
[1] Chen, Tianxing, et al. "RoboDojo: A unified sim-and-real benchmark for comprehensive evaluation of generalist robot manipulation policies." arXiv preprint arXiv:2607.04434 2026.
[2] Li, Zaijing, et al. "Global prior meets local consistency: Dual-memory augmented vision-language-action model for efficient robotic manipulation." arXiv preprint arXiv:2602.20200 2026.
[3] Yang, Ganlin, et al. "EventVLA: Event-Driven Visual Evidence Memory for Long-Horizon Vision-Language-Action Policies." arXiv preprint arXiv:2606.20092 (2026).