The paper introduces Keyframe Mnemonics, a self‑supervised approach that identifies critical observations (mnemonics) to aid behavior cloning in non‑Markovian settings. By training a policy conditioned on these keyframes, the method achieves perfect success rates on synthetic memory tasks and improves performance on a real‑robot manipulation benchmark, maintaining high success even at horizons far beyond training. The approach offers theoretical context‑retention guarantees and practical scalability to long‑horizon decision making.
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: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.
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...
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%.
arXiv:2608. 09853v1 Announce Type: cross Abstract: General-purpose reward models are increasingly the bottleneck for scaling robot learning, yet the recipe for learning value-related capabilities from large-scale heterogeneous corpora remains underexplored.
arXiv:2609.32453v2 Announce Type: replace-cross Abstract: Robotic manipulation is inherently history-dependent, yet most pretrained robotic policies condition on only the current observation or a sho...
arXiv:2606. 16447v1 Announce Type: cross Abstract: Imitation learning has enabled highly-dexterous robotic manipulation from RGB observations.
arXiv:2610.20318v1 Announce Type: cross Abstract: Reinforcement-learning policies for robot locomotion can fail at deployment when operating conditions shift (e.g., rough or slippery terrain, payload...
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.
OGPO is an Offline Goal‑conditioned Policy Optimization framework designed to improve Vision‑Language‑Action (VLA) models for robotic manipulation. It replaces traditional step‑wise action imitation with adaptive relabeling of trajectories using semantic key states and goal‑conditioned rewards, enabling policies to reach task‑progress states even from off‑demonstration states. Experiments on LIBERO, MetaWorld, LIBERO‑Plus, and the proposed LIBERO‑ReAct benchmark show that OGPO consistently outperforms standard supervised fine‑tuning in terms of robustness and recoverability under distribution shifts.
arXiv:2605.11151v3 Announce Type: replace Abstract: Offline-to-online reinforcement learning (RL) improves sample efficiency by leveraging pre-collected datasets prior to online interaction. A key ch...