Vision-language-action models often predict actions from only the current observation, which can leave tasks involving object occlusion or visually identical objects ambiguous without episode history. The usual countermeasure, widening the observation window, turns the horizon into a hyperparameter and lets per-step cost grow with it. We instead capture the episode in a recurrent state. SmoLSTM couples a frozen 256M-parameter SmolVLM backbone to a matrix-memory LSTM control layer in which observation tokens and action queries are unified in a single causal stream that is never reset throughout the entire episode. Recurrent-state storage is therefore O(1) in episode length. A flow-matching action head predicts chunks of 10 end-effector pose deltas and gripper commands at each control step. Our single policy, trained jointly on 7,461 demonstrations across 140 tasks and evaluated on held-out initial states, performs best, reaching 85.1% subgoal coverage and 77.5% full-task success on LIBERO-Mem with 0.04B trainable parameters, surpassing both the benchmark's own object-centric baseline and recent memory-based approaches. Resetting the recurrent state at every control step reduces full-task success to 7.0%, showing that the trained policy relies on context carried between decisions. The same model achieves 79.6% average success on standard LIBERO.
Figures & tables
Fig. 2: Scene camera view of two held-out LIBERO-Mem episodes solved by SmoLSTM, closed-loop in simulation. The badge gives the relative time of the frame (%). Top: ‘Rotate the 3 bowls on their plates from left to right using the empty plate’; Bottom: ‘Put the cream cheese in the nearest basket and place the empty basket in the center’. Both examples illustrate long-horizon manipulation in which later decisions depend on information accumulated earlier in the episode.
Fig. 3: Reading the frozen VLM. The scene frame and the instruction pass once through the frozen SmolVLM-256M-SigLIP vision tower, connector, and the 30 -layer SmolLM2 language model. The last-layer hidden states at the 64 image-placeholder positions are reshaped into an 8×8 grid and projected into spatial policy tokens; because the instruction precedes the image in the prompt, these positions are already language-conditioned under causal masking. A text-only pass is read out at layers 1 and 30 and pooled into 8 ordered segment tokens each (Sec. III-F ); it is computed once per instruction and cached.
Fig. 4: Instruction content across the VLM depth. (a) Cosine similarity for near-duplicate (solid) and unrelated (dashed) instruction pairs. (b) Near-duplicate separability measured by the whitened margin. (c) Held-out linear-probe accuracy for object/receptacle/side/verb. Probe accuracy plateaus early, collapses at the mid-depth anisotropy jump, and recovers at the last layer; the deployed taps [1,30] (dashed) sit at the two ends of this U-shape.
Model
Coverage a (%)
Success b (%)
Train.
Wrist
E.-S.SSM [ 8 ]
14.8
n/r
n/r
n/r
MemoryVAM [ 10 ]
n/r
42.5
n/r
–
2AM [ 9 ]
76.29
63.00
n/r
✓
SmoLSTM (regr.)
71.7
65.0
0.04B
✓
SmoLSTM (flow)
85.1
77.5
0.04B
✓
TABLE I: LIBERO-Mem results over 10 tasks. Our models use 20 trials per task on held-out initial states.
Model
VLM
Params
Train.
PT
Wrist
Roll.
Spatial
Object
Goal
Long
Avg.
A. Single policy, joint multi-suite training
Compact policies ( ≤ 0.5B)
SmolVLA (0.24B) [ 12 ] † ♣
256M
0.24B
n/r
–
✓
10
87.0
93.0
88.0
63.0
82.8
SmoLSTM (flow)
256M
0.32B
0.04B
–
✓
50
78.0
89.6
81.2
69.4
79.6
SmoLSTM (regression)
256M
0.32B
0.04B
–
✓
50
63.2
80.0
72.8
47.4
65.9
SmolVLA (0.45B) [ 12 ] † ¶
500M
0.45B
0.10B
–
✓
10
90.0
96.0
92.0
71.0
87.3
TABLE II: LIBERO success rates (%), grouped by training protocol and model scale. Panel A trains one policy jointly on all four suites; Panel B fine-tunes a separate policy per suite. “VLM” (M) is the nominal parameter count, in millions, of the pretrained vision–language backbone; “Train.” is the number of parameters updated; “PT” marks pretraining on large-scale robot data before LIBERO training; “Wrist” marks a wrist (eye-in-hand) camera input. Roll. is rollouts per task. The best (bold) and second best (underlined) results are marked.
Cov.
Succ.
OM
OS
OR
OO
None (reference)
85.1
77.5
98
94
8
95
Recurrent state wiped every N control steps
N=30
80.7
74.5
95
96
2
82
N=20
76.9
64.0
100
94
8
25
N=10
68.5
56.0
100
80
0
20
N=5
55.4
43.5
88
65
0
0
TABLE III: Ablations on the reported checkpoint. Coverage and success are over the 10 LIBERO-Mem tasks (20 trials/task, held-out init states); the per-class columns are the success by memory type.
Vision-Language-Action models provide a strong foundation for general-purpose robot control, yet a vast majority of policies do not preserve and leverage episode-level information beyond the current observation. This limitation is consequential in history-dependent manipulation tasks that depend on information available only in past observations. Retaining past observations in context can aid in recovering this information, but at the significant cost of ever-growing, bloated context and inference latency. We thus introduce MemBodied, a fixed-size episodic memory with two complementary components: an associative state that records interactions across policy calls and an episode anchor that preserves a compact representation of the initial scene as a reference. At each policy call, the model conditions action generation on the current input and the memory components, rather than directly using past observations. Across five evaluated RMBench tasks requiring memory, MemBodied achieves 7.81× the mean success rate of a stateless policy and 2.98× of vanilla recurrent memory, while outperforming the strongest memory-augmented baseline by 1.3× with 10× fewer added parameters. On the fully observable LIBERO-Long suite, it reached 90.6%, a 5.4% improvement over the stateless π0 policy. These findings support MemBodied as a practical alternative to expanding the policy context for history-dependent manipulation.
Tej Deep Pala, Navonil Majumder, Bryce Goh +4
Nanyang Technological University · Griffin Labs · École Centrale de Lyon
Memory-dependent manipulation requires a policy to track execution state and recover visual evidence that is no longer observable. We propose dual-stream memory for vision-language-action policies, assigning these requirements to complementary representations. A task-agnostic Gated DeltaNet compresses history into one temporal token, supervised by progress prediction and action-conditioned feature reconstruction. A task-conditioned retriever retains frames above a fixed relevance threshold; linear multi-scale fusion encodes each frame into sixteen spatial tokens. We then freeze the temporal compressor and jointly optimize retrieval and policy learning. Across sixteen RoboMME tasks, the complete model achieves 49.22% mean success versus 44.51% for the published FrameSamp+Modul reference, improving fourteen tasks and all four suite means. On four real-robot tasks, mean success reaches 62.5% versus 37.5%, with the largest gains on repeated actions requiring execution-stage discrimination. These results support combining execution context with selective visual access, while failures under cup swaps expose persistent identity tracking as an unresolved requirement.
Yang Wang, Ping Liu, Ruiyu Wang +3
Magic-Lab Team, Magiclab Robotics Inc. · University of California, Los Angeles, USA
Vision-language-action (VLA) models have driven rapid progress in robotic manipulation, demonstrating strong fine-grained control and promising performance on long-horizon tasks. However, many existing VLAs lack explicit access to interaction history, making them vulnerable to perceptual aliasing: similar current observations and robot states at different task stages may induce action ambiguity and lower success rate. Existing methods incorporate temporal or progress cues through feature conditioning, action-prior modification, or sampling guidance. However, methods that jointly fine-tune memory modules and the base VLA incur additional policy-training costs, motivating the separation of trainable history-conditioned steering from frozen base-policy refinement. We propose ActMem-VLA, a dual-expert handover architecture that augments a frozen, fine-tuned VLA with a memory plugin comprising a Mamba-based memory module and a lightweight PreAction Expert (PAE). Specifically, Mamba encodes executed-action history into memory that conditions PAE alongside current context. With these inputs, PAE steers task progression during early, high-noise denoising, then passes the partially denoised action to the frozen Action Expert (AE) to refine action details during the remaining low-noise steps. The fine-tuned base VLA remains frozen throughout training, while only the Mamba module and PAE are jointly optimized. On LIBERO-Mem, ActMem-VLA achieves 80.8% average success across all ten tasks, compared with 65.2% for π0.5 and 49.5% for MemoryVLA, while introducing only 3.45% additional parameters. Across four real-world tasks, it improves the average success rate over π0.5 by 28.8%.
Yaxin Zhao, Dianye Huang, Chenwei Wang +2
Harbin Institute of Technology, Harbin, China. · Medical Intelligence and Robotic Cognition (MIRoC) Lab, Department of Mechanical Engineering, The University of Hong Kong (HKU), Hong Kong SAR, China. · Department of Computing, The Hong Kong Polytechnic University, Hong Kong SAR, China