DEFLECT: Delay-Robust Execution via Flow-matching Likelihood-Estimated Counterfactual Tuning for VLA Policies

• URL: http://arxiv.org/abs/2605.19294v1
• Date: Tue, 19 May 2026 03:14:11 GMT
• Title: DEFLECT: Delay-Robust Execution via Flow-matching Likelihood-Estimated Counterfactual Tuning for VLA Policies
• Abstract summary: DEFLECT substantially extends the usable delay envelope of async VLA control, with +6.4 success-rate gain in the high-latency regime (5-7 control steps), +4.6 when transferred to a real-scale VLA at the longest delay.
• Score: 12.248643831532663
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Vision-Language-Action (VLA) policies are typically deployed with asynchronous inference: the robot executes a previously predicted action chunk while the model computes the next one. This creates a prediction-execution misalignment: the chunk is conditioned on the observation taken before inference began, but executes in a physical state that has already drifted forward by several control steps; naive asynchronous rollover collapses from 89% to under 1% on Kinetix as the inference cycle covers up to seven control steps. We introduce DEFLECT, a fully offline post-training refinement that applies as a near drop-in upgrade to existing async-VLA stacks by converting latency itself into a label-free preference signal: counterfactual fresh/stale action pairs are constructed from a frozen reference policy and scored under the deployment-time conditioning via an implicit flow-matching likelihood-ratio surrogate, with no human labels, reward models, or online rollouts. DEFLECT substantially extends the usable delay envelope of async VLA control, with +6.4 success-rate gain in the high-latency regime (5-7 control steps), +4.6 when transferred to a real-scale VLA at the longest delay, and consistent improvements on two real-robot tasks (a bimanual conveyor pick-and-place and a reactive whack-a-mole).

Related papers

• PhaseLoRA: Control-Regime-Conditioned Low-Rank Adaptation for Continuous-Action Vision-Language-Action Policies [74.07190331264488]
  We propose a lightweight LoRA parameterization that conditions adaptation at each action-chunk prediction step.<n>PhaseLoRA modulates the LoRA left factor in the action expert, allowing the effective low-rank update direction to vary over time.<n>Results establish within-trajectory conditioning as an effective lightweight PEFT axis for continuous-action VLA policies.
  arXiv  Detail & Related papers  (2026-08-15T15:32:08Z)
• BICPO-VLA: Behavior-Identified Continuation Preference Optimization for Smooth Asynchronous Vision-Language-Action Control [32.93954687398763]
  BICPO-VLA addresses the gap between request-to-handoff and request-to-handoff mismatches.<n>An instruction-aware causal history encoder identifies the behavior supported by the command and current task progress.<n>BICPO rolls the known outgoing actions to the actual handoff state and applies reference-relative Flow-DPO among behaviorally matched candidates.
  arXiv  Detail & Related papers  (2026-08-14T03:51:27Z)
• FBFM: A Training-Free Asynchronous Feedback Mechanism for Flow-Matching in World-Action Models Execution [50.18922379062543]
  We present Feedback Flow Matching (FBFM), a training-free inference mechanism that pushes re-grounding inside actively generated chunks.<n>Being training-free, the mechanism improves responsiveness to unexpected events and suppresses drift in long-horizon tasks.<n>We evaluate FBFM on both a joint-generation WAM and a stage-wise WAM.
  arXiv  Detail & Related papers  (2026-07-31T10:11:09Z)
• FutureRTC: Real-Time Robot Execution with Anticipatory-Conditioned Action Chunking [51.97839311685636]
  FutureRTC is a plug-and-play adaptation framework that predicts execution-time observations and states for asynchronous VLA control without modifying the underlying policy.<n>We show that FutureRTC achieves robustness to inference delays, resulting in smoother trajectories, faster execution, and consistently higher task success rates.
  arXiv  Detail & Related papers  (2026-07-27T05:10:16Z)
• SEAM: Smooth Execution of Action-Chunked Motion for Vision-Language-Action Policies [26.372187124257362]
  Vision-Language-Action (VLA) policies that execute fixed-length action chunks can exhibit multimodal bifurcation.<n>We propose SEAM (Smooth Execution of Action-Chunked Motion), a training-free inference-time method for flow matching VLAs.<n>On LIBERO-10 with pi_0.5, SEAM reduces boundary jerk by 28%, reduces chunk transition discontinuity by 27%, preserves baseline-level task success, and keeps denoising-loop cost near the unguided baseline.
  arXiv  Detail & Related papers  (2026-07-06T02:32:10Z)
• Action ControlNet: A Lightweight Delay-Aware Adapter for Smooth Asynchronous Control in Vision-Language-Action Models [2.1822977353368778]
  Action ControlNet (ACNet) is a lightweight delay-aware adapter for vision-language--action models.<n>ACNet improves robustness under inference delay and yields smoother asynchronous trajectories than direct chunk stitching.
  arXiv  Detail & Related papers  (2026-06-24T15:53:43Z)
• Dynamic Execution Commitment of Vision-Language-Action Models [21.647844049489535]
  We introduce A3, an Adaptive Action Acceptance mechanism that reframes dynamic execution commitment as a self-speculative prefix verification problem.<n>A3 first computes a trajectory-wise consensus score of actions via group sampling, then selects a representative draft and prioritizes downstream verification.<n> Experiments across diverse VLA models and benchmarks demonstrate that A3 eliminates the need for manual horizon tuning while achieving a superior trade-off between execution and inference throughput.
  arXiv  Detail & Related papers  (2026-05-12T05:52:58Z)
• VLA-ATTC: Adaptive Test-Time Compute for VLA Models with Relative Action Critic Model [54.35791816657227]
  We introduce textbfVLA-ATTC', a framework that endows VLA models with adaptive test-time compute.<n>VLA-ATTC employs an uncertainty-based cognitive clutch'' to dynamically transition from reflexive execution to a TTC deliberation phase.<n>On the LIBERO-LONG benchmark, VLA-ATTC reduces the failure rate of the SOTA model PI0.5 by over 50%.
  arXiv  Detail & Related papers  (2026-05-02T02:13:11Z)
• DiscreteRTC: Discrete Diffusion Policies are Natural Asynchronous Executors [57.944744187489185]
  We propose DiscreteRTC, which replaces external corrections with native unmasking.<n>DiscreteRTC is simpler to implement with 0 lines of code for async inpainting, faster at inference with only 0.7x computation compared with generating actions from scratch, and better at execution with 50% higher success rate in real-world dynamic pick task compared with flow-based RTC.
  arXiv  Detail & Related papers  (2026-04-27T23:04:03Z)
• Open-Loop Planning, Closed-Loop Verification: Speculative Verification for VLA [27.06233662271175]
  We propose Speculative Verification for VLA Control (SV-VLA), a framework that combines efficient open-loop long-horizon planning with lightweight closed-loop online verification.<n> Experiments demonstrate that SV-VLA combines the efficiency of chunked prediction with the robustness of closed-loop control, enabling efficient and reliable VLA-based control in dynamic environments.
  arXiv  Detail & Related papers  (2026-04-03T10:55:51Z)
• FASTER: Rethinking Real-Time Flow VLAs [82.58822112377923]
  Real-time execution is crucial for deploying Vision-Language-Action (VLA) models in the physical world.<n>We show that reaction time follows a uniform distribution determined jointly by the Time to First Action (TTFA) and the execution horizon.<n>We propose Fast Action Sampling for ImmediaTE Reaction (FASTER) to overcome this issue.
  arXiv  Detail & Related papers  (2026-03-19T17:51:37Z)
• AsyncVLA: An Asynchronous VLA for Fast and Robust Navigation on the Edge [49.66156306240961]
  High latency breaks the control loop, rendering powerful models unsafe for real-time deployment.<n>We propose AsyncVLA, an asynchronous control framework that decouples semantic reasoning from reactive execution.<n>AsyncVLA achieves a 40% higher success rate than state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-02-13T21:31:19Z)
• Steering Vision-Language-Action Models as Anti-Exploration: A Test-Time Scaling Approach [78.4812458793128]
  We propose textbfTACO, a test-time-scaling framework that applies a lightweight pseudo-count estimator as a high-fidelity verifier of action chunks.<n>Our method resembles the classical anti-exploration principle in offline reinforcement learning (RL), and being gradient-free, it incurs significant computational benefits.
  arXiv  Detail & Related papers  (2025-12-02T14:42:54Z)
• Leave No Observation Behind: Real-time Correction for VLA Action Chunks [36.13271200613596]
  Asynchronous Action Chunk Correction (A2C2) is a lightweight real-time chunk correction head that runs every control step.<n>We show that A2C2 is an effective plug-in mechanism for deploying high-capacity chunking policies in real-time control.
  arXiv  Detail & Related papers  (2025-09-27T10:07:49Z)
• One-Step Diffusion Policy: Fast Visuomotor Policies via Diffusion Distillation [80.71541671907426]
  OneStep Diffusion Policy (OneDP) is a novel approach that distills knowledge from pre-trained diffusion policies into a single-step action generator. OneDP significantly accelerates response times for robotic control tasks.
  arXiv  Detail & Related papers  (2024-10-28T17:54:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.