arXiv AI

MEMOBench: A Process Level Memory Benchmark for Robotic Manipulation

arXiv AI
Oct 16

RMBench: Memory-Dependent Robotic Manipulation Benchmark with Insights into Policy Design

RMBench is a simulation benchmark featuring nine robotic manipulation tasks that vary in memory complexity, designed to systematically evaluate how well policies use memory. The authors also introduce Mem-0, a modular policy with explicit memory components that allows controlled ablation studies. Experiments in simulation and the real world reveal memory-related limitations in current policies and show how architectural choices affect memory performance.

By Tianxing Chen, Yuran Wang, Mingleyang Li, Yan Qin, Hao Shi, Zixuan Li, Yifan Hu, Yingsheng Zhang, Kaixuan Wang, Yue Chen, Hongcheng Wang, Junjie Wang, Tianhang Yang, Renjing Xu, Ruihai Wu, Yao Mu, Yaodong Yang, Hao Dong, Ping Luo
arXiv AI
Oct 16

LTM: Latent Transition Based In-Context Memory for Vision-Language-Action Models

The paper introduces Latent Transition Memory (LTM), a method that stores interaction history as compact latent transitions between consecutive observations for vision‑language‑action models. Implemented as LTM‑π on the π₀.₅ architecture, it uses a frozen latent action encoder, a lightweight adapter, and causal KV caching to enable incremental inference without external reasoning models or memory‑specific annotations. Experiments on RoboMME and LIBERO‑Mem show that LTM‑π achieves state‑of‑the‑art success rates (58.54% and 80.5% respectively), and scaling the dataset or applying a 200‑token memory budget still yields high performance, demonstrating the method’s scalability and efficiency in real‑world robotic tasks.

By Qixin Sun, WenLong Gao, Xiansheng Chen, Zhongyuan Wang, Si Liu, Pengwei Wang
arXiv AI
Aug 5

Gated Memory Policy: In-Context Memorization and Adaptation

arXiv:2604. 18933v2 Announce Type: replace-cross Abstract: Robotic manipulation tasks exhibit varying memory requirements, ranging from Markovian tasks that require no memory to non-Markovian tasks that demand in-context memorization of historical information within a single trial or in-context adaptation based on the outcomes of multiple past trials.

By Yihuai Gao, Jeff Jinyun Liu, Shuang Li, Shuran Song
arXiv AI
Oct 2

Divide-and-Remember: Recursive Action-Relevant Memory for Long-Horizon VLA Policies

The paper introduces Divide-and-Remember (D&R), a recursive memory method for vision-language-action (VLA) policies that optimises memory by maximizing the conditional mutual information between actions and memory given observations. D&R recursively divides the full history into top‑K selections over 2K tokens, using a shared lightweight selector across all recursion blocks to handle unbounded histories efficiently. Evaluated on the RoboMME benchmark of 16 long‑horizon manipulation tasks, D&R achieves state‑of‑the‑art success rates with consistent gains across all suites while using only 64 tokens, and similar improvements are observed in real‑robot experiments.

By Xuehui Yu, Eason Yu, Meiyi Wang, Haozhe Du, Stefano V. Albrecht, Harold Soh
arXiv AI
Sep 18

Workspace Models: Lightweight Robotic Memory via Saliency-Driven Supervision

The paper introduces the workspace token, a lightweight latent memory representation for robotic manipulation that captures task-relevant historical information. By training with VLM queries only during training, the token can be queried efficiently at deployment, replacing full observations. Experiments in simulation and on hardware show that policies using the workspace token solve memory-intensive tasks without in‑loop VLM reasoning and even outperform heavier approaches.

By Nitish Dashora, Douglas Chen, Idan Shenfeld, John Marangola, Pulkit Agrawal, Max Simchowitz