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.
arXiv:2511. 18960v4 Announce Type: replace Abstract: Vision-Language-Action (VLA) models have shown remarkable progress in embodied tasks recently, but most methods process visual observations independently at each timestep.
arXiv:2610.14406v1 Announce Type: cross Abstract: It is widely appreciated that robotic policies require long-term memory to perform complex tasks. However, directly conditioning policies on all past...
arXiv:2606.20092v3 Announce Type: replace Abstract: Memory remains a critical bottleneck for long-horizon robotic manipulation, as standard Vision-Language-Action (VLA) policies often fail when task-...
arXiv:2609.34792v2 Announce Type: replace Abstract: Long-horizon manipulation requires robots to remember cues that are no longer in view while responding to moving objects. Yet vision-language-actio...
The paper introduces a dual‑stream memory architecture for vision‑language‑action policies, separating a task‑agnostic temporal compressor from a task‑conditioned visual retriever. The temporal compressor uses a Gated DeltaNet to condense history into a single token, while the retriever keeps frames above a relevance threshold and fuses them into spatial tokens. Evaluated on sixteen RoboMME tasks and four real‑robot tasks, the combined model outperforms the FrameSamp+Modul baseline, achieving higher mean success rates and notable gains on tasks requiring execution‑stage discrimination.
arXiv:2603. 04910v2 Announce Type: replace-cross Abstract: Imitation learning from human demonstrations has achieved significant success in robotic control, yet most visuomotor policies still condition on single-step observations or short-context histories, making them struggle with non-Markovian tasks that require long-term memory.
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.
arXiv:2609.16864v1 Announce Type: cross Abstract: Vision-language-action (VLA) models have achieved impressive performance in quasi-static manipulation, but struggle in dynamic manipulation tasks bec...
arXiv:2608. 04765v1 Announce Type: cross Abstract: Vision-language-action (VLA) models provide a unified paradigm for connecting visual perception, language understanding, and robotic control.
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.
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.
MemBodied introduces a fixed‑size episodic memory for Vision‑Language‑Action models, comprising an associative state that tracks interactions across policy calls and an episode anchor that stores a compact representation of the initial scene. By conditioning action generation on these memory components instead of raw past observations, MemBodied reduces context bloat and inference latency. In five memory‑dependent RMBench tasks, it outperforms stateless and vanilla recurrent policies by significant margins, and achieves a 90.6% success rate on the LIBERO‑Long suite, improving over the baseline by 5.4%.