arXiv Machine Learning

SimpleMemVLA: A Simple but Effective Native-Video Memory for Vision-Language-Action Models

arXiv Computer Vision
Oct 23

UniMem: Unifying Visual and Textual Memory in VLAs for Non-Markovian Tasks

UniMem is a framework that unifies visual and textual memory with low‑level control in a single Vision‑Language‑Action model, using an event classifier, keyframe encoder, and caching to manage memory efficiently. It addresses non‑Markovian tasks that require remembering past scenes, avoiding the memory bottleneck of separate VLMs and the performance drop from fixed‑interval frame sampling. Across five simulation and four hardware tasks, UniMem outperforms fixed‑interval sampling (93.4% vs. 68.2%) and hierarchical VLM‑VLA baselines (80.0% vs. 43.5%) while offering faster inference and a simpler training pipeline.

By Lars Osterberg, Maggie Wang, Mac Schwager
arXiv AI
Oct 16

Memory as Weights: Internalizing Long-Term History for Streaming Videos

The paper introduces MaLoW, a streaming memory framework that internalizes long‑term video history into evolving lightweight parameter updates using a recurrent HyperNetwork and LoRA weights. MaLoW keeps current observations as input while carrying historical context forward without re‑visiting the full video stream. The authors also present MaLoW‑Instruct, a large streaming video dataset, and show that MaLoW outperforms prior memory methods on several benchmarks and improves action success in a vision‑language‑action setting.

By Zhuoming Liu, Jinhong Lin, Lin Zhang, Yiwu Zhong, Yin Li
arXiv Machine Learning
Oct 19

When Plans Change, Remember: Replanning-Guided Visual Memory for Vision-Language-Action Models

The paper introduces RePlanMem-VLA, a selective visual memory system for Vision‑Language‑Action models that uses a policy’s own plan revisions as an online memory‑write signal. By detecting unusually large disagreements between temporally aligned action predictions, the method identifies task‑relevant events and updates a bounded visual memory while suppressing redundant frames. Experiments on MIKASA‑Robo‑VLA tasks and real‑robot replay data show that RePlanMem‑VLA retains essential observations in every episode and achieves high ROC‑AUC scores for event detection.

By Victoria Smelova, Daniil Kazachkov, Georgiy Kazantsev, Iuliia Tsvetkova, Egor Cherepanov, Nikita Kachaev, Artem Latyshev, Aleksandr I. Panov, Alexey K. Kovalev
arXiv Machine Learning
Jun 9

Echo-Memory: A Controlled Study of Memory in Action World Models

arXiv:2606. 09803v1 Announce Type: cross Abstract: We present \textbf{Echo-Memory}, a controlled study of memory mechanisms in action-conditioned world models.

By Wayne King, Zeyue Xue, Yuxuan Bian, Jie Huang, Haoran Li, Yaowei Li, Yaofeng Su, Yuming Li, Haoyu Wang, Shiyi Zhang, Songchun Zhang, Yuwei Niu, Sihan Xu, Junhao Zhuang, Haoyang Huang, Nan Duan
arXiv Computer Vision
Oct 21

CondenseVLA: Learnable History Condensation for Efficient Multi-Frame VLA

CondenseVLA introduces a learnable history‑condensation module that distills short‑term visual context into a fixed set of slot tokens via learnable queries and cross‑attention, reducing redundancy and improving action decoding. The approach achieves notable gains on several robot manipulation benchmarks, raising Simpler‑WidowX success from 58.7% to 69.8%, reaching 97.2% on LIBERO, 52.8% on real‑world tasks, and 21.6% on memory‑dependent RMBench tasks.

By Feiyang Hong, Yujie Wei, Bo Zhao, Xiu Su, Hongxun Yao, Shuo Yang
Hugging Face Trending Papers
Jul 29

TurboVLA: Real-Time Vision-Language-Action Model at 32 Hz on an RTX 4090 with <1 GB VRAM

Vision-language-action (VLA) models commonly adopt an LLM-centric $V \to L \to A$ pathway, where visual observations are projected into the representation space of a large language model before being decoded into robot actions. Although effective, this design incurs substantial computation and memory overhead at every policy invocation.