StateMem: Single-State Residual Memory with Adaptive Inference for Vision-Language-Action Policies
Authors: Wenzhuo Li, Qiongfeng Shi, Yi Zhou
Organizations: School of Computer Science and Engineering, Southeast University, China · Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications, Ministry of Education, China · School of Electronic Science & Engineering, Southeast University, China
Memory-dependent robotic manipulation often requires later actions to use information from earlier interactions. Existing vision-language-action (VLA) policies primarily rely on current observations, limiting historical information retention. Memory-augmented VLAs, such as MemoryVLA, address this limitation with external memory banks but require explicit storage and retrieval. To address these limitations, we propose StateMem, a single-state residual memory framework for VLA policies that uses prediction error to update a persistent memory token through low-rank residuals and to adaptively route cached prefixes. A training-free controller adjusts the routing threshold online, while fast correction compensates for stale prefix features during cache reuse. We evaluate StateMem on LIBERO, RoboMemArena, and real-world manipulation tasks. On LIBERO, StateMem achieves an average success rate of 97.6% and reduces the average VLM prefix refresh rate by 20.25% relative to full refresh. In the Occlusion category of RoboMemArena, StateMem achieves the best performance among single-VLA methods, reaching 21.8% Task Success Rate (TSR) and 44.3% Cumulative Success Rate (CSR). Across six real-world manipulation tasks, it achieves +21% in average success rate.
Figures & tables
Fig. 1: Comparison of memory mechanisms in VLA policies. (a) Markovian VLA uses the current observation only; (b) Multi-Frame VLA uses k historical frames; (c) Memory-Bank VLA explicitly stores and retrieves historical information; and (d) StateMem maintains a single memory token and uses prediction error to update the memory through a low-rank residual.
Fig. 2: The architecture of StateMem. (A) Model Architecture, which integrates visual and language inputs with a persistent memory state for action generation. (B) Memory Update, where prediction error is used to update the memory through a low-rank residual. (C) Fast Correction, which uses the latest perceptual and memory features to compensate for changes during cached reuse. (D) Online Threshold Adaptation, which combines exponential moving average (EMA) statistics and periodic action audits to adapt the routing threshold and decide between cache reuse and refresh.
Fig. 3: Overview of simulation benchmarks and results. Representative tasks from LIBERO and RoboMemArena are shown together with the corresponding quantitative comparisons.
Method
Spatial
Object
Goal
Long
Avg.
Diffusion Policy [ 40 ]
78.3
92.5
68.3
50.5
72.4
MDT [ 41 ]
78.5
87.5
73.5
64.8
76.1
Octo [ 25 ]
78.9
85.7
84.6
51.1
75.1
Dita [ 42 ]
84.2
96.3
85.4
63.8
82.4
OpenVLA [ 3 ]
84.7
88.4
79.2
53.7
76.5
TraceVLA [ 43 ]
84.6
85.2
75.1
54.1
74.8
TABLE I: Success rates (%) on LIBERO benchmark suites. We compare StateMem with representative VLA baselines and memory-augmented models. bold and underline indicate the best and second best performance, respectively.
Method
Architecture
Transferring
Occlusion
Counting
Sequence
Average
TSR
CSR
TSR
CSR
TSR
CSR
TSR
CSR
TSR
CSR
MemER [ 8 ]
VLM + VLA
20.0
36.1
16.4
33.2
27.1
65.1
65.0
79.1
27.3
49.1
PrediMem [ 31 ]
VLM + VLA
22.5
45.2
27.3
38.4
45.7
69.3
72.5
89.5
38.5
55.2
π0.5 [ 5 ]
VLA
20.0
42.8
12.7
17.2
14.3
50.9
60.0
71.6
21.5
38.7
HiF-VLA [ 48 ]
VLA
17.5
38.9
12.7
27.1
8.6
45.9
42.5
70.2
16.9
39.8
MemoryVLA [ 9 ]
VLA
15.0
37.2
7.3
13.1
14.3
55.1
37.5
65.2
15.0
35.3
TABLE II: TSR and CSR (%) on RoboMemArena. We compare StateMem with representative VLA baselines and memory-augmented models. Bold and underline indicate the best and second-best performance, respectively, within the VLA category.
Fig. 4: Overview of the real-world evaluation. Visualization of the evaluation platform, manipulation tasks, OOD settings, and corresponding success rates.
Method
Pick Fruits
Flip Mug
Stack Cups
Press Buttons
Cover & Uncover
Pick & Count
Avg.
π0.5 [ 5 ]
85
80
40
60
0
0
44
MemoryVLA ⋄ [ 9 ]
85
75
35
60
50
15
53
StateMem (Ours)
90
85
55
75
60
25
65
TABLE III: Success rates (%) on real-world tasks. ⋄ indicates our reimplementation based on π0.5 . Each task is evaluated over 20 independent trials from randomized initial states.
Category
Method
Refresh (%) ↓
Latency (ms) ↓
Throughput (Hz) ↑
TSR (%) ↑
CSR (%) ↑
Memory
StateMem
100.0
134.5
7.8
27.7
45.4
w/o residual memory
100.0
189.5
5.5
22.8
39.0
w/o prediction error
100.0
135.2
7.7
25.0
42.9
Inference
StateMem
98.9
137.9
7.3
26.8
44.4
w/o prefix routing
100.0
135.1
7.6
26.8
44.5
w/o fast correction
98.8
137.5
7.3
26.2
43.4
TABLE IV: Ablation results on RoboMemArena. The Memory category compares variants trained for 40K steps in Stage 1, while the Inference category compares full-model inference paths. Arrows indicate preferred metric directions.
Method
Refresh rate (%) ↓
Latency (ms) ↓
Throughput (Hz) ↑
Success rate (%) ↑
StateMem (Full Refresh)
100.00
156.36
6.40
96.90
StateMem
79.75
150.78
6.64
97.60
TABLE V: Average inference efficiency and success rate on LIBERO. Full Refresh uses the same complete model but forces a full VLM prefix refresh at every policy query.
Fig. 5: Memory retention and efficiency. (a) History-separation ROC-AUC measures whether each evaluated representation assigns larger distances to pairs with different stage histories than to matched pairs with the same history; 0.5 corresponds to random guessing, and higher values indicate stronger historical information. (b) Efficiency comparison among π0.5 , MemoryVLA, and StateMem, including the full-refresh configuration. ⋄ indicates our reimplementation based on π0.5 .
Most vision-language-action (VLA) models rely on current observations and lose task-relevant evidence once it leaves view, limiting performance on long-horizon, memory-dependent tasks. Existing efforts incorporate compressed historical features or sparse visual keyframes. However, isolated snapshots can leave the policy uncertain about what changed during past interactions and which action should follow. To overcome this limitation, we propose EvoMem-VLA, which constructs state-evolution memory by explicitly encoding and retaining observed changes between historical states. These change representations preserve evidence of interaction outcomes, allowing the policy to track task progress beyond isolated snapshots. Specifically, we introduce conditional delta tokenization to encode ordered frame pairs into directional, source-conditioned delta tokens, each associated with its corresponding state evidence. A shared VLM backbone supports task-adaptive routing: normal long-horizon tasks follow a direct action route, whereas multi-stage tasks use a subtask route that generates an executable subtask as an additional input for action generation. With a single jointly trained policy for each simulation benchmark, EvoMem-VLA achieves success rates of 80.7% on RMBench, 82.0% on RoboMME and 83.8% across four real-world tasks spanning two robot embodiments. These results represent substantial improvements over the previous state of the art in all three evaluation settings.
Yuheng Na, Zhide Zhong, Junjie He +7
Xi’an Jiaotong University · The Hong Kong University of Science and Technology (Guangzhou) · Xbotics Embodied AI Community +1
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
Mainstream Vision-Language-Action (VLA) models predict actions primarily from the current observation under a Markovian assumption, thus struggling with long-horizon, temporally dependent tasks. Existing memory-augmented VLAs either expand the observation window or retrieve history from the memory bank as auxiliary policy-side context. However, they leave memory outside the native latent embedding space of VLA reasoning, preventing historical experience from being fluidly interleaved with multimodal reasoning and action formation. To this end, we introduce LaMem-VLA, a latent-memory-native framework that reconstructs historical experience into latent memory tokens and directly interweaves them with VLA reasoning. At its core, LaMem-VLA introduces four coordinated components: (i) a curator that organizes historical experience into two complementary short-term and long-term memory vaults; (ii) a seeker that queries both vaults using the multimodal cognition to retrieve context-relevant evidence; (iii) a condenser that reconstructs the retrieved evidence into compact short-term and long-term latent memory tokens; and (iv) a weaver that injects these memory tokens with the current observation and instruction into one continuous embedding sequence. By representing, retrieving, and consuming historical experience entirely in the same continuous latent space, LaMem-VLA enables memory to directly participate in VLA reasoning and guide action generation under a bounded context. Extensive experiments on SimplerEnv and LIBERO demonstrate the superiority of our LaMem-VLA.
Hongyu Qu, Jianzhe Gao, Xiaobin Hu +6
Nanjing University of Science and Technology · Zhejiang University · National University of Singapore