arXiv:2608. 16889v1 Announce Type: cross Abstract: Long-horizon robot manipulation chains many contact-rich skills into one multi-stage task.
arXiv:2608. 03483v1 Announce Type: cross Abstract: Existing chunk-based Vision-Language-Action (VLA) models execute a fixed number of actions (i.
arXiv:2607. 16506v1 Announce Type: cross Abstract: Vision-Language-Action (VLA) policies offer strong general-purpose manipulation priors, but often fail on tight-tolerance, contact-rich assembly due to long-horizon credit assignment and subtask coupling: a state that is geometrically successful for the current skill can be brittle for downstream skills.
arXiv:2608. 19891v1 Announce Type: new Abstract: How to efficiently finetune robot policies to learn new tasks on the fly?
arXiv:2608.21407v1 Announce Type: cross Abstract: Vision-language-action (VLA) models face a crucial tradeoff between their task success rate and the policy-call frequency. Executing a single action...
arXiv:2606. 27755v1 Announce Type: cross Abstract: Vision-Language-Action (VLA) models enable instruction-driven robotic manipulation, but they inherit oversized language backbones from pretrained VLMs whose capacity far exceeds what is needed for short robotic instructions.
The paper introduces Boundary-Aware Skill Memory (BASM), a method that enriches skill memories for large language model agents with explicit boundary fields such as applicability conditions, risk cues, avoidance rules, and recovery notes. This approach transforms retrieved skills from unconditional templates into state‑conditioned guidance, preventing the Skill Imitation Trap where more skills lead to incorrect tool usage. Experiments on three agent benchmarks and four model scales show that BASM improves task success rates, accuracy, and reduces attack success while cutting average steps compared to memory‑free baselines.
VLCP (Vision Language Control Policy) is a training‑free robot manipulation approach that keeps a vision‑language model (VLM) frozen and uses it to generate short Python control functions. Unlike traditional methods that retry a fixed policy, VLCP rewrites the control code every K steps based on multi‑view RGB, proprioceptive state, and state delta, allowing failures to be corrected within the same episode. In a 57‑task MuJoCo/RoboVerse benchmark, VLCP achieves 35.1% pooled success versus 3.5% for a single‑query baseline, with a 27.3% within‑episode recovery rate on failed grasps and efficient token usage.
arXiv:2607. 09042v1 Announce Type: new Abstract: Reinforcement learning (RL) is increasingly used to post-train vision-language-action (VLA) models, but every update consumes robot rollouts that are slow and costly to collect, making sample efficiency a central concern.
arXiv:2607. 25487v1 Announce Type: new Abstract: Vision-Language-Action (VLA) models translate natural-language commands into robot action sequences, but leading systems on the LIBERO-Plus robustness benchmark use three- to seven-billion-parameter backbones whose memory demands can exceed embedded robotic budgets.
arXiv:2603. 24576v2 Announce Type: replace-cross Abstract: Robots often observe information that determines a future action long before that action is executed.
ForeTime‑VLA is a causal vision‑language‑action policy that distills future‑aware representations from a frozen Fast‑WAM teacher, enabling it to anticipate contact events during conveyor‑belt manipulation. The method compresses current and future video latents into a 64‑dimensional target, uses an eight‑frame history encoder to predict this target along with manipulation phase and time‑to‑transition, and conditions a VLM prefix on future tokens and phase. On a deduplicated conveyor‑belt dataset, ForeTime‑VLA reduces test MAE by 2.63% and L2 by 3.02%, while real‑robot experiments show significantly higher grasp success rates compared to the next‑best reference. whyItMatters":"The approach demonstrates that distilling future‑token knowledge from a world‑action model can improve dynamic manipulation performance without the computational cost of running the teacher at inference time."