Gamma: Grounded Multi-Agent Memory with Mechanical Audit for Memory-Intensive Manipulation
cs.RO
Submitted: 2026-10-08
Updated: 2026-10-08
Code: https://github.com/1999Lyd/GAMMA
License: http://creativecommons.org/licenses/by/4.0/
The gist: Pretrained vision-language-action (VLA) policies fail on memory tasks, behaviour that depends on events observed long before the current frame, because their training data is overwhelmingly Markov
Terminology
Abstract
Pretrained vision-language-action (VLA) policies fail on memory tasks, behaviour that depends on events observed long before the current frame, because their training data is overwhelmingly Markov and mapping episodic memory directly to action chunks is hard. Yet the same policy, finetuned once to follow a privileged oracle's grounded-subgoal text, nearly solves these tasks: the difficulty lies entirely in mapping memory to a grounded symbolic subgoal. Existing work entrusts this stage to a single VLM that selects keyframes and reasons over raw frames, and falls far short of the oracle: key identities and dynamics are buried in noisy pixels, the reasoning spans hundreds of frames in an unbounded context, and hallucination corrupts the memory itself. We instead present GAMMA (Grounded multi-Agent Memory with Mechanical Audit), which builds the stage as a collaborating two-agent memory system: a detector tool (SAM-3) for spatial grounding, a VLM writer that distils each replan window into one grounded text line, an append-only text memory bank, and a VLM reasoner that reads the bank and emits the next grounded subgoal at the oracle's cadence, wrapped in a propose-verify harness that admits, defers, corrects, or rejects every agent claim against mechanical visual evidence, at training-corpus construction and at deployment alike. On a sixteen-task memory-manipulation suite GAMMA recovers a large fraction of the oracle ceiling with the policy held fixed, reaching the ceiling on several tasks, and transfers with unchanged contracts to a second benchmark.
Sources
- Do As I Can, Not As I Say: Grounding Language in Robotic Affordances
- $\pi_0$: A Vision-Language-Action Flow Model for General Robot Control
- RT-1: Robotics Transformer for Real-World Control at Scale
- RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control
- Recurrent Memory Transformer
- SAM 3: Segment Anything with Concepts
- AURA: Action-Gated Memory for Robot Policies at Constant VRAM
- RMBench: Memory-Dependent Robotic Manipulation Benchmark with Insights into Policy Design
- Memory, Benchmark & Robots: A Benchmark for Solving Complex Tasks with Reinforcement Learning
- ELMUR: External Layer Memory with Update/Rewrite for Long-Horizon RL Problems
- Diffusion Policy: Visuomotor Policy Learning via Action Diffusion
- RoboMME: Benchmarking and Understanding Memory for Robotic Generalist Policies
- PaLM-E: An Embodied Multimodal Language Model
- AGM: Achievement-Grounded Memory for Closed-Loop Agents with Frozen VLA Policies
- AMAGO: Scalable In-Context Reinforcement Learning for Adaptive Agents
- Visual Programming: Compositional visual reasoning without training
- RoboCerebra: A Large-scale Benchmark for Long-horizon Robotic Manipulation Evaluation
- Deep Recurrent Q-Learning for Partially Observable MDPs
- LoRA: Low-Rank Adaptation of Large Language Models
- Inner Monologue: Embodied Reasoning through Planning with Language Models
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- ARC: A Reasoning Recipe for Robot Foundation Models
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies