Training-Free Memory Layer for Robotics
Training-Free, non-parametric, retrieval-augmented Memory Conditioned Action Generation framework for improving long-horizon VLA performance
Vision-Language-Action (VLA) models have fundamentally shifted the paradigm of robotic control, enabling generalist agents to follow natural language instructions. However, these foundation models struggle significantly with long-horizon tasks. Because they typically operate as reactive, first-order Markovian systems, they rely almost entirely on immediate sensory input and ignore historical context. This dynamic induces compounding errors over extended inference timesteps and leaves models vulnerable to perceptual aliasing—where visually identical pre- and post-grasp scenes cause unstable action predictions.
To solve this, we developed a Training-Free Memory Conditioned Action Generation framework. This non-parametric, retrieval-augmented system conditions a frozen VLA on historical expert trajectories, guiding action generation without requiring any fine-tuning or architectural changes.
Methodology: How Training-Free Memory Works
Our framework bypasses the computational bottlenecks of traditional fine-tuning, such as catastrophic forgetting and exhaustive hyperparameter searches. Instead, it uses a plug-and-play memory module designed for fast, inference-time adaptation.
- Memory Construction: We build an external memory bank by slicing expert training trajectories into sliding-window chunks. Each chunk consists of a vision-language model (VLM) embedding and a corresponding robot state embedding.
- State-Centric Retrieval: Because visual embeddings can lack fine-grained discriminative power during distribution shifts, we retrieve memories using purely proprioceptive state embeddings.
- High-Speed Indexing: To ensure low latency, the system organizes these state embeddings using a Hierarchical Navigable Small World (HNSW) data structure. This allows for highly efficient, high-recall approximate nearest neighbor searches using the $L_2$ distance metric.
- Selective Gating: The memory is not always active. To preserve fast inference times on simple tasks, we employ an adaptive fallback strategy that triggers memory conditioning only when the base policy fails.
Evaluation and Breakthrough Results
We rigorously evaluated our framework against state-of-the-art models (such as FlowerVLA and MoDE) across 5 datasets from the popular CALVIN and LIBERO benchmarks.
- Benchmark Dominance: Our method achieved relative gains of up to 27% in task completion success rates over standard baselines.
- Long-Horizon Extension: We extended the CALVIN benchmark to test extreme task horizons (6 to 10 sequential instructions). Under these highly complex conditions, our framework yielded up to 30% relative improvement margins.
- Robustness to Corruption: When deployed in simulated out-of-distribution (OOD) environments featuring visual corruptions like defocus, smudges, and sensor dead pixels, the memory-conditioned models mitigated performance degradation, showing average absolute gains of 10.7%.
Real-World Deployment
To validate the framework’s practical viability, we deployed it on a physical Cobot-Magic-AgileX robot equipped with a 6-DOF arm. The robot was tasked with a sequential, long-horizon objective: reaching a microwave, opening the door, and placing a bowl inside.
Evaluated heavily under real-world OOD conditions (such as skewed microwave placement and handle occlusions), the memory-augmented system demonstrated remarkable resilience, realizing up to a 2X increase in success rates compared to the base policy.