AGM: Achievement-Grounded Memory for Closed-Loop Agents with Frozen VLA Policies
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
The paper introduces 2AM, a system that keeps task memory solely within a multimodal Agent while using a single RGB‑based, stateless Action Model to execute motions. By compiling interaction history into subtask language and optional 2D grasp/place/move hints, the Agent steers the Action Model, which is trained to tolerate imperfect guidance through dropout, noise, and jitter. On the LIBERO‑Mem benchmark, 2AM achieves 76.3% average completion without depth, geometry, or planners, vastly outperforming the best baseline.
The paper introduces 2AM, a system that separates memory and action execution in long‑horizon robot manipulation. 2AM stores task memory exclusively in a multimodal Agent, while a single RGB‑based, stateless Action Model performs motion based on language and optional 2D hints. On the LIBERO‑Mem benchmark, 2AM achieves 76.3% average completion—over 61 points higher than the best baseline—demonstrating that agent‑side memory and precise steering of the Action Model can substantially improve performance.
arXiv:2609.07047v1 Announce Type: cross Abstract: Robotic manipulation often requires acting on information that is no longer visible, yet Vision-Language-Action policies are usually evaluated when t...
arXiv:2609.36595v1 Announce Type: cross Abstract: Visual-memory systems commonly retain or compress past observations. Robot control additionally requires interaction-derived state that no individual...
arXiv:2610.00604v1 Announce Type: cross Abstract: Vision-language-action policies often see only one or a few recent frames, which makes it difficult to evaluate how they use information that disappe...
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.