AsyncVLA: Asynchronous Flow Matching for Vision-Language-Action Models

Yuhua Jiang, Shuang Cheng, Yan Ding, Feifei Gao, Biqing QiarXiv 2025 · DOI · arXiv

Introduction

Vision-Language-Action (VLA) models serve as the foundational control systems for modern generalist robots, mapping visual observations and natural language instructions to physical actions. Many current state-of-the-art VLAs utilize Flow Matching (FM)—a generative modeling technique akin to diffusion—to produce continuous action trajectories. However, standard FM implementations are inherently synchronous, generating entire action "chunks" (e.g., 10-step sequences) under a rigid, uniform time schedule.

This synchronous approach suffers from two primary limitations. First, it is prone to cascading errors; a single miscalculated token in a long-horizon task can derail the entire sequence without a mechanism for localized correction. Second, it lacks context awareness, applying the same computational intensity to simple movements as it does to high-precision tasks.

Comparison between Vanilla Flow Matching and the proposed Asynchronous Flow Matching (AFM).

The AsyncVLA Framework

AsyncVLA addresses these issues by reframing action generation as a two-stage, confidence-aware process that moves away from rigid schedules. The framework consists of three main components:

  1. Synchronous Flow Matching (SFM) Stage: The model first generates an initial "draft" of the action chunk using standard uniform flow matching.
  2. Confidence Rater: A lightweight transformer-based module analyzes the draft alongside the vision-language context. It assigns a confidence score to each action token, identifying potential errors or areas of uncertainty.
  3. Asynchronous Flow Matching (AFM) Stage: Tokens identified with low confidence are "masked" and sent back for regeneration. Crucially, high-confidence tokens are retained as "action context," providing a stable path that guides the model in refining the problematic segments.
The AsyncVLA architecture, highlighting the Confidence Rater and the transition from Synchronous to Asynchronous Flow Matching.

To maintain computational efficiency, AsyncVLA reuses Key-Value (KV) caches from the initial stage, as the visual and linguistic inputs remain constant between the draft and refinement. This optimization makes the refinement stage approximately 8x faster than the initial generation, adding only a 10.5% overhead to total inference time. Furthermore, a novel Asynchronous Time Embedding allows the transformer to distinguish between fixed context tokens and those currently undergoing refinement.

Key Insights and Results

The core philosophy of AsyncVLA is the mimicry of "System 2" thinking—a fast intuitive response followed by deliberate checking. By treating high-confidence tokens as fixed anchors, the model reduces the search space for the refinement stage, making the generation task significantly easier and more accurate. This unified training approach also acts as a powerful data augmentation technique, forcing the model to understand the temporal dynamics between actions more robustly.

AsyncVLA achieved state-of-the-art (SOTA) results across several major benchmarks:

  • LIBERO: Achieved a 97.4% average success rate, significantly outperforming vanilla OpenVLA (76.5%).
  • WidowX (SimplerEnv): Reached a 70.8% average success rate, the highest among compared models like π0 and Octo.
  • Self-Correction: In qualitative evaluations, the model demonstrated the ability to correct errors in real-time, such as adjusting a "drop" command into a "keep grasping" action to prevent a cup from tipping.

Conclusion and Future Work

AsyncVLA provides a robust and efficient framework for robotic control by introducing asynchronous refinement. While the model currently performs a single round of refinement, future work may explore iterative processes or dynamic "thinking time" based on scene complexity. Additionally, further optimization for high-frequency real-time control on physical hardware remains an area for development.

Summary updated

Abstract

Vision-language-action (VLA) models have recently emerged as a powerful paradigm for building generalist robots. However, traditional VLA models that generate actions through flow matching (FM) typically rely on rigid and uniform time schedules, i.e., synchronous FM (SFM). Without action context awareness and asynchronous self-correction, SFM becomes unstable in long-horizon tasks, where a single action error can cascade into failure. In this work, we propose asynchronous flow matching VLA (AsyncVLA), a novel framework that introduces temporal flexibility in asynchronous FM (AFM) and enables self-correction in action generation. AsyncVLA breaks from the vanilla SFM in VLA models by generating the action tokens in a non-uniform time schedule with action context awareness. Besides, our method introduces the confidence rater to extract confidence of the initially generated actions, enabling the model to selectively refine inaccurate action tokens before execution. Moreover, we propose a unified training procedure for SFM and AFM that endows a single model with both modes, improving KV-cache utilization. Extensive experiments on robotic manipulation benchmarks demonstrate that AsyncVLA is data-efficient and exhibits self-correction ability. AsyncVLA outperforms existing methods across both simulation and real-world evaluations. Our code is available at https://github.com/YuhuaJiang2002/AsyncVLA.
BibTeX
@misc{jiang2025asyncvla,
  author = {Yuhua Jiang and Shuang Cheng and Yan Ding and Feifei Gao and Biqing Qi},
  title = {{AsyncVLA: Asynchronous Flow Matching for Vision-Language-Action Models}},
  year = {2025},
  eprint = {2511.14148},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2511.14148},
}
Figure