The DOI matches its Crossref record; none of the 49 sources its claims cite is checked for support yet.
Fine-Tuning Vision-Language-Action Models: Optimizing Speed and Success
Open accessAbstract
Recent vision-language-action models (VLAs) build upon pretrained vision-language models and leverage diverse robot datasets to demonstrate strong task execution, language following ability, and semantic generalization.Despite these successes, VLAs struggle with novel robot setups and require finetuning to achieve good performance, yet how to most effectively fine-tune them is unclear given many possible strategies.In this work, we study key VLA adaptation design choices such as different action decoding schemes, action representations, and learning objectives for fine-tuning, using OpenVLA as our representative base model.Our empirical analysis informs an Optimized Fine-Tuning (OFT) recipe that integrates parallel decoding, action chunking, a continuous action representation, and a simple L1 regression-based learning objective to altogether improve inference efficiency, policy performance, and flexibility in the model's input-output specifications.We propose OpenVLA-OFT, an instantiation of this recipe, which sets a new state of the art on the LIBERO simulation benchmark, significantly boosting OpenVLA's average success rate across four task suites from 76.5% to 97.1% while increasing action generation throughput by 26×.In real-world evaluations, our fine-tuning recipe enables OpenVLA to successfully execute dexterous, high-frequency control tasks on a bimanual ALOHA robot and outperform other VLAs (π0 and RDT-1B) fine-tuned using their default recipes, as well as strong imitation learning policies trained from scratch (Diffusion Policy and ACT) by up to 15% (absolute) in average success rate.We release code for OFT and pretrained model checkpoints at https://openvla-oft.github.io.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 49 cited sources checked · 0 supported · 0 flagged
- Findingcitation
The success-rate improvement from parallel decoding and action chunking was especially large in the LIBERO-Long task suite.
“This improvement is particularly pronounced in LIBERO-Long, suggesting that action chunking helps capture temporal dependencies [28] and reduce compounding errors [41], which ultimately leads to smoother and more reliable task execution.”
Quote in the paperNot a substantial claim - Findingreasoning
Continuous action variants achieved a 5 percentage point higher average success rate than the discrete action variant.
“In addition, we nd that using continuous action variants further improves success rates by 5% (absolute) over the discrete action variant, likely due to higher precision in the action predictions.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Findingreasoning
Despite its high latency, the 50-step diffusion variant achieved the same effective throughput as baseline OpenVLA because of parallel decoding and action chunking.
“However, it still achieves the same effective throughput as baseline OpenVLA due to parallel decoding and action chunking.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
Combining action chunking with parallel decoding dramatically improved throughput, yielding a 26-fold speedup over baseline OpenVLA.
“Adding action chunking ( K = 8 ) increases latency by 17% due to longer attention sequences in the decoder, but when combined with parallel decoding, it dramatically improves throughput, achieving a 26 speedup over baseline OpenVLA.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
Policies using L1 regression and policies using diffusion achieved similar performance.
“L1 regression and diffusion variants achieve comparable performance, indicating that the high-capacity OpenVLA model can effectively model the multi-task action distribution even with simple L1 regression.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Findingown data
OpenVLA's autoregressive generation makes action chunking impractical because generating a single-timestep action takes 0.33 seconds on an NVIDIA A100 GPU.
“However, OpenVLA's autoregressive generation scheme makes action chunking impractical, as generating even a single-timestep action takes 0.33 seconds on an NVIDIA A100 GPU.”
Quote in the paperSubstantial claim - Findingown data
Adding action chunking with chunk size 8 increased latency by 17% because of longer attention sequences in the decoder.
“Adding action chunking ( K = 8 ) increases latency by 17% due to longer attention sequences in the decoder, but when combined with parallel decoding, it dramatically improves throughput, achieving a 26 speedup over baseline OpenVLA.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingreasoning
Success rates decreased when fewer denoising steps were used.
“However, the success rates decrease with fewer denoising steps due to reduced model quality.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
Parallel decoding shows no performance degradation across diverse tasks despite being theoretically less expressive than autoregressive approaches.
“While parallel decoding may theoretically be less expressive than autoregressive approaches, our experiments show no performance degradation across diverse tasks.”
Quote in the paperSubstantial claim - Findingown data
Adding additional inputs improved average success rates across all LIBERO task suites.
“Evaluating these policies with additional inputs on the LIBERO benchmark reveals further improvements in average success rate across all task suites (Table I).”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Findingnone given
Continuous action representations improve model quality compared to discrete representations.
“(2) continuous action representations further improve model quality compared to discrete representations;”
Quote in the paperSubstantial claim- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
- Findingown data
Treating individual patch embeddings as features to be modulated results in poor language following.
“While one might naturally consider treating individual patch embeddings as features to be modulated, we find that this approach results in poor language following.”
Quote in the paperSubstantial claim - Findingown data
Using parallel decoding and action chunking together increased average success rates by 14 percentage points compared with autoregressive OpenVLA policies.
“Results in Table I show that parallel decoding and action chunking not only increase throughput but also improve performance signi cantly, raising average success rates by 14% (absolute) over autoregressive OpenVLA policies.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Findingreasoning
The continuous-action variant with L1 regression had negligible efficiency difference from the base model because its additional MLP action head adds minimal computational cost.
“The continuous actions variant with L1 regression shows negligible difference in ef ciency since the additional MLP action head adds minimal computational cost compared to the base model.”
Quote in the paperNot a substantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
Using fewer than 50 denoising steps at inference time produced much greater inference efficiency.
“These con gurations result in much greater inference ef ciency, as shown in Table II.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
When deploying on the ALOHA robot with multiple viewpoints including wrist-mounted cameras, policies can struggle with language following due to spurious correlations in visual inputs.
“When deploying on the ALOHA robot setup with multiple viewpoints including from wrist-mounted cameras, we observe that policies can struggle with language following due to spurious correlations in visual inputs.”
Quote in the paperSubstantial claim- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
- Findingreasoning
The 50-step diffusion variant completed robot episodes at the same speed as the original autoregressive variant.
“This means that despite longer pauses between action chunks, the 50-step diffusion variant still completes robot episodes at the same speed as the original autoregressive variant.”
Quote in the paperNot a substantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingnone given
With 25-timestep action chunks, OpenVLA-OFT+ achieves 43 times faster throughput than base OpenVLA.
“With 25-timestep action chunks, OpenVLA-OFT+ achieves 43× faster throughput than base OpenVLA, demonstrating that our new fine-tuning recipe enables real-time robot control with strong task performance and language following ability.”
Quote in the paperSubstantial claim- Rests on an assumption: The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
- Findingown data
Adding robot proprioceptive state and a wrist-mounted camera image to OpenVLA doubled the visual patch embeddings passed to the language model decoder, from 256 to 512.
“We demonstrate this by ne-tuning OpenVLA with additional inputs such as robot proprioceptive state and a robot wrist-mounted camera image, which doubles the number of visual patch embeddings being passed into the language model decoder, from 256 to 512.”
Quote in the paperNot a substantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Findingown data
Diffusion Policy matched or exceeded RDT-1B's reliability on the clothes folding and scooping tasks.
“Diffusion Policy demonstrates stronger capabilities, matching or exceeding RDT-1B's reliability on the clothes folding and scooping tasks.”
Quote in the paperNot a substantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Findingown data
The base OpenVLA pretrained representations are beneficial for robotic policy learning, as removing them caused a 5.2 percentage point drop in average success rate on the LIBERO evaluation suite.
“As shown in Table XV, the base OpenVLA pretrained representations are indeed still bene cial for robotic policy learning, as removing them leads to a 5.2% drop in average success rate (absolute) in our LIBERO evaluation suite.”
Quote in the paperNot a substantial claim - Findingcitation
RDT-1B achieved good language following through its Alternating Condition Injection scheme.
“Among VLAs, we observe distinct characteristics: RDT-1B achieves good language following through its Alternating Condition Injection scheme [27], but shows a limitation in handling closed-loop feedback.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [27]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Findingown data
OpenVLA-OFT+ achieved the highest average performance among the compared methods.
“Fine-tuned VLAs consistently outperform from-scratch methods, with OpenVLA-OFT+ achieving the highest average performance.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Findingown data
The full OpenVLA-OFT method with additional inputs achieved a state-of-the-art average success rate of 97.1%.
“Our full OpenVLA-OFT method with additional inputs achieves state-of-the-art 97.1% average success rate.”
Quote in the paperSubstantial claim - Findingown data
Diffusion Policy struggled with the put X into pot task, which had a larger training dataset.
“However, it struggles with the put X into pot task which has a larger training dataset, suggesting limited scalability compared to VLA-based approaches.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Findingown data
RDT-1B often failed to correct mistakes in the scoop X into bowl task.
“As visualized in Figure 6, it often fails to correct mistakes in the scoop X into * We use this FiLM-Ef cientNet implementation only for languagedependent tasks ( scoop X into bowl and put X into pot ).”
Quote in the paperNot a substantial claim- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Findingown data
RDT-1B showed a limitation in handling closed-loop feedback.
“Among VLAs, we observe distinct characteristics: RDT-1B achieves good language following through its Alternating Condition Injection scheme [27], but shows a limitation in handling closed-loop feedback.”
Quote in the paperNot a substantial claim- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Premisecitation
Vision-language-action models built from pretrained vision-language models and trained on large robot datasets show strong task performance, semantic generalization, and language following across many robots and tasks.
“Recent vision-language-action models (VLAs)-robot policies built by fine-tuning pretrained vision-language models on large-scale robot datasets for low-level robotic control-have demonstrated strong task performance, semantic generalization, and language following abilities across diverse robots and tasks [4,34,24,23,7,15,8,53,58,3].”
Quote in the paperSubstantial claim0 of 10 sources checked- cites [4]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [34]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [24]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [7]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [15]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [8]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [53]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [58]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationnone given
The drop in success rates with fewer denoising steps is caused by reduced model quality.
“However, the success rates decrease with fewer denoising steps due to reduced model quality.”
Quote in the paperSubstantial claim - Premisecitation
OpenVLA originally uses discrete action tokens where each action dimension is normalized to [-1, +1] and uniformly discretized into 256 bins.
“OpenVLA originally uses discrete action tokens where each action dimension is normalized to [-1, +1] and uniformly discretized into 256 bins.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Premisecitation
Autoregressive action generation in Kim et al.'s LoRA vision-language-action model remains too slow at 3-5 Hz for high-frequency control at 25-50+ Hz.
“However, their autoregressive action generation remains too slow (3-5 Hz) for high-frequency control (25-50+ Hz), and both LoRA and full fine-tuning of autoregressive VLAs often yield unsatisfactory performance in bimanual manipulation tasks [54,27,3].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationcitation
Feature-wise linear modulation infuses language embeddings into visual representations so the model pays more attention to language inputs.
“To enhance language following, we employ featurewise linear modulation (FiLM) [37], which infuses language embeddings into the visual representations so that the model pays more attention to the language inputs.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [37]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
During training, policies may learn to rely on spurious correlations when predicting actions rather than attending to language instructions, causing poor adherence to user commands at test time.
“During training, policies may learn to latch onto such spurious correlations when predicting actions, rather than properly attending to the language instructions, resulting in poor adherence to the user's commands at test time.”
Quote in the paperSubstantial claim - Interpretationreasoning
Combined with parallel decoding and action chunking, the architecture can efficiently process rich multimodal inputs while generating multiple timesteps of actions.
“Combined with parallel decoding and action chunking, this architecture can efficiently process rich multimodal inputs while generating multiple timesteps of actions, as illustrated in Figure 1.”
Quote in the paperSubstantial claim - Interpretationown data
OpenVLA, being a high-capacity model, can effectively model the multi-task action distribution even when using simple L1 regression.
“L1 regression and diffusion variants achieve comparable performance, indicating that the high-capacity OpenVLA model can effectively model the multi-task action distribution even with simple L1 regression.”
Quote in the paperSubstantial claim - Interpretationreasoning
Applying each element of the scaling and shifting vectors to the corresponding hidden unit across all visual patch embeddings, as in convolutional feature-wise linear modulation, is the chosen modulation approach.
“Instead, drawing from how FiLM operates in convolutional networks, where modulation applies spatially-agnostically by scaling and shifting entire feature maps, we apply each element of γ and β to the corresponding hidden unit across all visual patch embeddings so that and in uence all patch embeddings.”
Quote in the paperSubstantial claim - Premisecitation
Kim et al.'s analysis does not cover bimanual robots with high control frequencies of 25-50+ Hz.
“While Kim et al. [23] study various parameter update strategies and from their findings show that LoRA finetuning enables effective adaptation to single-arm robots operating at low control frequencies (< 10 Hz), their analysis does not extend to bimanual robots with high control frequencies (25-50+ Hz), a more complex control scenario.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
Discretizing actions can sacrifice fine-grained action details.
“While this approach is convenient since it requires no architectural modifications to the underlying VLM, the discretization process can sacrifice fine-grained action details.”
Quote in the paperSubstantial claim - Premisecitation
Significant latency between action chunks, such as 750 ms for FAST, still limits real-time deployment on high-frequency bimanual robots.
“While recent approaches improve efficiency through better action tokenization schemes [2,38], achieving 2 to 13× speedups, significant latency between action chunks (e.g., 750 ms for the recent FAST approach [38]) still limits real-time deployment on high-frequency bimanual robots.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [38]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
Using empty action embeddings and replacing causal attention with bidirectional attention allows the decoder to predict all actions simultaneously.
“We modify the model to receive empty action embeddings as input and replace the causal attention mask with bidirectional attention, allowing the decoder to predict all actions simultaneously.”
Quote in the paperSubstantial claim - Interpretationreasoning
The large speedup from parallel decoding and action chunking creates capacity to process additional model inputs.
“The signi cant speedup realized by parallel decoding and action chunking creates headroom for processing additional model inputs as well.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Interpretationreasoning
The higher success rates of continuous action variants are likely caused by more precise action predictions.
“In addition, we nd that using continuous action variants further improves success rates by 5% (absolute) over the discrete action variant, likely due to higher precision in the action predictions.”
Quote in the paperSubstantial claim - Premisecitation
Recent action tokenization schemes achieve 2 to 13 times speedups for autoregressive vision-language-action models.
“While recent approaches improve efficiency through better action tokenization schemes [2,38], achieving 2 to 13× speedups, significant latency between action chunks (e.g., 750 ms for the recent FAST approach [38]) still limits real-time deployment on high-frequency bimanual robots.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [2]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [38]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationown data
Parallel decoding combined with action chunking is required for high-frequency control at 25-50+ Hz, particularly for bimanual robots with twice the action dimensions.
“Our ef ciency analysis (which we discuss later) reveals that parallel decoding (PD) and action chunking (AC) together are necessary for high-frequency control (25-50+ Hz), especially for bimanual robots with double the amount of action dimensions.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
- Interpretationreasoning
Parallel decoding reduces action generation from D sequential passes to a single pass, where D is the action dimensionality.
“This reduces action generation from D sequential passes to a single pass, where D is the action dimensionality.”
Quote in the paperSubstantial claim - Premisecitation
Vanilla LoRA fine-tuning with autoregressive VLAs is impractical for dexterous bimanual tasks because its throughput of 3-5 Hz for single-arm robots and even lower for bimanual tasks is below the 25-50 Hz needed for real-time deployment.
“Prior works [54,27,3] have shown that vanilla LoRA netuning with autoregressive VLAs [23] is impractical for such tasks, as its throughput (3-5 Hz for single-arm robots and even lower for bimanual tasks) falls well below the 25-50 Hz required for real-time deployment.”
Quote in the paperSubstantial claim0 of 4 sources checked- cites [54]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [27]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: Real-time deployment of bimanual manipulation policies requires control frequencies of 25–50 Hz.
- Interpretationreasoning
The ALOHA tasks present a significant adaptation challenge for OpenVLA as the base model.
“The ALOHA tasks present a signi cant adaptation challenge for OpenVLA as the base model, given the substantial differences from its pretraining platforms in terms of control frequency, action space, and input modalities.”
Quote in the paperSubstantial claim- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- Interpretationreasoning
The distribution shift between ALOHA and OpenVLA's pretraining poses a challenge for adapting the model.
“The distribution shift poses a challenge to the adaptation of this model.”
Quote in the paperSubstantial claim - Interpretationown data
Diffusion Policy's difficulty with the put X into pot task suggests that it has limited scalability compared with VLA-based approaches.
“However, it struggles with the put X into pot task which has a larger training dataset, suggesting limited scalability compared to VLA-based approaches.”
Quote in the paperNot a substantial claim- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
- It may state two separate claims as one. 35
- Probably not a substantial claim. 11
It may state two separate claims as one.
Findingown dataParallel decoding with action chunking boosts inference efficiency, improves success rates on downstream tasks, and enables greater flexibility in model input-output specifications.
“Our study reveals several key insights that build on each other: (1) parallel decoding with action chunking not only boosts inference efficiency but also improves success rates on downstream tasks while enabling greater flexibility in the model's input-output specifications;”
Quote in the paperSubstantial claim- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
It may state two separate claims as one.
Findingown dataPolicies fine-tuned with a simpler L1 regression objective can match more complex approaches in task performance while achieving significantly greater inference efficiency.
“Through controlled experiments, we show that policies fine-tuned with a simpler L1 regression objective can match more complex approaches in task performance while achieving significantly greater inference efficiency.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
Findingown dataThe enhanced fine-tuned OpenVLA policies outperformed the best fine-tuned π0 policies as well as MDT and Seer policies.
“Notably, our enhanced ne-tuned OpenVLA policies outperform even the best ne-tuned 0 policies [3, 38] which bene t from a base model with larger-scale pretraining and a more sophisticated learning objective ( ow matching [25]) as well as Multimodal Diffusion Transformer (MDT) [40] and Seer [50] policies.”
Quote in the paperSubstantial claim0 of 4 sources checked- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [38]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [40]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [50]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
It may state two separate claims as one.
Findingown dataIn LIBERO, OpenVLA-OFT achieves 97.1% average success across four task suites, outperforming fine-tuned OpenVLA at 76.5% and π0 at 94.2% while achieving a 26 times speedup in action generation with 8-step action chunks.
“In LIBERO, OpenVLA-OFT establishes a new state of the art by achieving 97.1% average success rate across four task suites, outperforming both fine-tuned OpenVLA policies [23] (76.5%) and π 0 policies [3] (94.2%) while achieving a 26× speedup in action generation with 8-step action chunks.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
It may state two separate claims as one.
Findingown dataThe primary diffusion variant required 50 denoising steps and therefore had high latency.
“The primary diffusion variant requires 50 denoising steps (since this is the number of steps speci ed at train time) and thus suffers from high latency.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
It may state two separate claims as one.
Findingown dataParallel decoding reduced latency and increased throughput by a factor of four by replacing seven sequential decoder forward passes with one pass.
“Results in Table II show that parallel decoding reduces latency and increases throughput by 4 by replacing 7 sequential forward passes through the decoder portion of the policy with a single pass.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
It may state two separate claims as one.
Findingown dataOpenVLA-OFT sets a new state of the art on LIBERO, raising OpenVLA's average success across four task suites from 76.5% to 97.1% and increasing action generation throughput by 26 times.
“We propose OpenVLA-OFT, an instantiation of this recipe, which sets a new state of the art on the LIBERO simulation benchmark, significantly boosting OpenVLA's average success rate across four task suites from 76.5% to 97.1% while increasing action generation throughput by 26×.”
Quote in the paperSubstantial claim- Rests on an assumption: The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
It may state two separate claims as one.
Findingown dataIn real-world evaluations, the fine-tuning recipe enables OpenVLA to execute dexterous high-frequency control tasks on a bimanual ALOHA robot and outperform other fine-tuned vision-language-action models and strong imitation learning policies trained from scratch by up to 15 percentage points absolute in average success rate.
“OpenVLA-OFT+ successfully executes dexterous bimanual tasks like folding clothes and manipulating target food items based on the user's prompt (see Figure 1), outperforming both fine-tuned VLAs (π 0 and RDT-1B) and prominent imitation learning policies trained from scratch (Diffusion Policy and ACT) by up to 15% (absolute) in average success rate.”
Quote in the paperSubstantial claim- Rests on an assumption: The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
It may state two separate claims as one.
Findingown dataParallel decoding paired with action chunking achieves 26 to 43 times throughput with much lower latency, 0.07 ms for single-arm tasks with one input image and 0.321 ms for bimanual tasks with three input images.
“Our parallel decoding approach, when paired with action chunking, achieves significantly greater speedups: 26× to 43× throughput with much lower latency (0.07 ms for single-arm tasks with one input image and 0.321 ms for bimanual tasks with three input images).”
Quote in the paperSubstantial claimIt may state two separate claims as one.
Findingown dataFine-tuning a vision-language-action model with an L1 regression objective yields performance comparable to diffusion-based fine-tuning while offering faster training convergence and inference speed.
“(3) fine-tuning the VLA with an L1 regression objective yields comparable performance to diffusion-based fine-tuning while offering faster training convergence and inference speed.”
Quote in the paperSubstantial claim- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
It may state two separate claims as one.
Findingown dataDespite the longer input sequence, the fine-tuned OpenVLA policy maintained high throughput of 71.4 Hz and low latency of 0.112 seconds.
“Despite this substantial increase in input sequence length, the ne-tuned OpenVLA policy maintains high throughput (71.4 Hz) and low latency (0.112 sec), as shown in Table II.”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
It may state two separate claims as one.
Findingown dataExecuting full action chunks before replanning improved both speed and performance.
“For methods using action chunking, we set chunk size to K = 8 to match the Diffusion Policy baseline [5], and execute full chunks before replanning, which we nd improves both speed and performance.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [5]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
Findingown dataACT produced less precise actions and achieved the lowest overall performance.
“ACT, while able to complete basic tasks, produces less precise actions and achieves the lowest overall performance.”
Quote in the paperNot a substantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
It may state two separate claims as one.
FindingcitationFine-tuned VLA policies generally outperformed from-scratch baselines in both task execution and language following.
“Fine-tuned VLA policies generally outperform the from-scratch baselines in both task execution and language following, consistent with prior ndings [27,3].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [27]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
- Rests on an assumption: The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
It may state two separate claims as one.
InterpretationreasoningFor chunk size K, parallel decoding predicts KD actions in one forward pass, increasing throughput K-fold with minimal latency impact.
“For chunk size K, the model predicts KD actions in one forward pass, increasing throughput K-fold with minimal latency impact.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
InterpretationreasoningL1 regression with an MLP action head maintains the efficiency benefits of parallel decoding while potentially improving action precision.
“The model is trained to minimize the mean L1 difference between predicted and ground-truth actions, maintaining the efficiency benefits of parallel decoding while potentially improving action precision.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
Interpretationown dataThe new fine-tuning recipe enables real-time robot control with strong task performance and language following ability.
“With 25-timestep action chunks, OpenVLA-OFT+ achieves 43× faster throughput than base OpenVLA, demonstrating that our new fine-tuning recipe enables real-time robot control with strong task performance and language following ability.”
Quote in the paperSubstantial claim- Rests on an assumption: The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
It may state two separate claims as one.
InterpretationreasoningLanguage inputs may only be critical at specific moments in a task, making it challenging to train the model to focus on language inputs without special techniques.
“Furthermore, language inputs may only be critical at specific moments in a task-for example, after grasping the spoon and deciding which ingredient to scoop in the”
Quote in the paperSubstantial claimIt may state two separate claims as one.
InterpretationcitationThe use of action chunking leads to smoother and more reliable task execution.
“This improvement is particularly pronounced in LIBERO-Long, suggesting that action chunking helps capture temporal dependencies [28] and reduce compounding errors [41], which ultimately leads to smoother and more reliable task execution.”
Quote in the paperSubstantial claimProbably not a substantial claim.
PremisecitationOpenVLA is a 7B-parameter manipulation policy created by fine-tuning the Prismatic vision-language model on 1M episodes from the Open X-Embodiment dataset.
“We use OpenVLA [23] as our representative base VLA, a 7B-parameter manipulation policy created by fine-tuning the Prismatic VLM [21] on 1M episodes from the Open X-Embodiment dataset [34].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [21]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [34]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
InterpretationreasoningConditional denoising diffusion modeling requires multiple forward passes during inference, 50 diffusion steps in this implementation, impacting deployment latency even with parallel decoding.
“While this approach offers potentially more expressive action modeling, it requires multiple forward passes during inference (50 diffusion steps in our implementation), impacting deployment latency even with parallel decoding.”
Quote in the paperSubstantial claimProbably not a substantial claim. The paper’s conclusions may not depend on it.
PremisecitationLoRA fine-tuning enables effective adaptation of vision-language-action models to single-arm robots operating at low control frequencies below 10 Hz.
“While Kim et al. [23] study various parameter update strategies and from their findings show that LoRA finetuning enables effective adaptation to single-arm robots operating at low control frequencies (< 10 Hz), their analysis does not extend to bimanual robots with high control frequencies (25-50+ Hz), a more complex control scenario.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
PremisecitationExisting approaches that fine-tune vision-language-action models using the base autoregressive training recipe face slow inference speed of 3-5 Hz unsuitable for high-frequency control and unreliable task execution on bimanual manipulators.
“Existing approaches that fine-tune VLAs using the base model's autoregressive training recipe face two key limitations: slow inference speed (3-5 Hz) unsuitable for high-frequency control, and unreliable task execution on bimanual manipulators [54,27,3].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [54]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [27]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Rests on an assumption: High-frequency bimanual robot control requires control frequencies of 25-50+ Hz.
- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
PremisecitationOpenVLA's original training formulation uses autoregressive prediction of 7 discrete robot action tokens per timestep: 3 for position control, 3 for orientation control, and 1 for gripper control.
“OpenVLA's original training formulation uses autoregressive prediction of 7 discrete robot action tokens per timestep: 3 for position control, 3 for orientation control, and 1 for gripper control.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
Interpretationown dataParallel decoding allows OpenVLA to generate action chunks with only a small latency increase, which enhances flexibility in model outputs.
“As explained in Section IV-B and validated by our ef ciency evaluations in the prior section, parallel decoding enables OpenVLA to generate action chunks with minimal latency increase, thereby enhancing exibility in model outputs .”
Quote in the paperSubstantial claim- Rests on an assumption: Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
It may state two separate claims as one.
InterpretationreasoningFor chunk size K and action dimensionality D, OpenVLA requires KD sequential decoder forward passes versus D without chunking, causing a K-fold latency increase that makes action chunking impractical for high-frequency robots under the original formulation.
“For a chunk size of K timesteps and action dimensionality D, OpenVLA requires KD sequential decoder forward passes versus just D passes without chunking.This K-fold increase in latency makes action chunking impractical for high-frequency robots under the original formulation.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
InterpretationreasoningFeature-wise linear modulation is used only for the ALOHA experiments because multiple camera viewpoints lead to a larger presence of spurious correlations in visual inputs.
“We only use FiLM for the ALOHA experiments discussed in Section VI, where multiple camera viewpoints lead to a larger presence of spurious correlations in visual inputs.”
Quote in the paperNot a substantial claim- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
Probably not a substantial claim. It may state two separate claims as one.
PremisereasoningDiffusion-based vision-language-action models achieve higher action throughput than autoregressive models by generating multi-timestep action chunks simultaneously, but introduce computational trade-offs through slower training and multiple denoising or integration steps at inference.
“While these diffusion-based VLAs achieve higher action throughput than autoregressive VLAs by generating multitimestep action chunks simultaneously, they introduce computational trade-offs through slower training and multiple denoising or integration steps at inference time.”
Quote in the paperSubstantial claimProbably not a substantial claim. It may state two separate claims as one.
InterpretationreasoningParallel decoding enables the model to map input embeddings to the predicted output sequence in a single forward pass, unlike autoregressive generation which requires sequential token prediction.
“Unlike autoregressive generation which requires sequential token prediction, parallel decoding enables the model to map input embeddings to the predicted output sequence in a single forward pass.”
Quote in the paperSubstantial claimProbably not a substantial claim.
InterpretationreasoningThe unified latent representation enables the model to attend to all available information when generating actions.
“This unified latent representation enables the model to attend to all available information when generating actions.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
InterpretationcitationAction chunking helps the policy capture temporal dependencies and reduces compounding errors.
“This improvement is particularly pronounced in LIBERO-Long, suggesting that action chunking helps capture temporal dependencies [28] and reduce compounding errors [41], which ultimately leads to smoother and more reliable task execution.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [28]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [41]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
Interpretationown dataThe Optimized Fine-Tuning recipe combines parallel decoding, action chunking, continuous action representation, and L1 regression to improve inference efficiency, policy performance, and input-output flexibility.
“Our empirical analysis informs an Optimized Fine-Tuning (OFT) recipe that integrates parallel decoding, action chunking, a continuous action representation, and a simple L1 regression-based learning objective to altogether improve inference efficiency, policy performance, and flexibility in the model's input-output specifications.”
Quote in the paperSubstantial claim- Rests on an assumption: OpenVLA is a representative base vision-language-action model for studying adaptation design decisions.
- Rests on an assumption: The three design components investigated are key for vision-language-action fine-tuning.
It may state two separate claims as one.
PremisecitationBoth LoRA and full fine-tuning of autoregressive vision-language-action models often perform unsatisfactorily on bimanual manipulation tasks.
“However, their autoregressive action generation remains too slow (3-5 Hz) for high-frequency control (25-50+ Hz), and both LoRA and full fine-tuning of autoregressive VLAs often yield unsatisfactory performance in bimanual manipulation tasks [54,27,3].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [54]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [27]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [3]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
InterpretationcitationThe paper's approach fine-tunes the base vision-language-action model end-to-end with techniques that enable high efficiency without needing a separate controller.
“Lastly, unlike prior work that relies on a separate faster low-level control policy in addition to a slower VLA [36], in this work we fine-tune the base VLA end-to-end with techniques that enable high efficiency without needing a separate controller.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [36]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim.
PremisecitationAction chunking, meaning predicting and executing a sequence of future actions without intermediate replanning, improves policy success rates across many manipulation tasks.
“Prior works have shown that action chunking-i.e., predicting and executing a sequence of future actions without intermediate replanning-improves policy success rates across many manipulation tasks [56,5,28].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [56]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [5]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [28]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
PremisecitationOpenVLA employs next-token prediction with cross-entropy loss as its learning objective.
“It employs next-token prediction with cross-entropy loss as its learning objective, similar to language models.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [23]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
It may state two separate claims as one.
Interpretationown dataEven though the base model was simpler and pretrained on less data, the alternative VLA adaptation design decisions allowed fine-tuned OpenVLA policies to achieve a new state of the art on LIBERO.
“Even with a simpler base model pretrained on less data than more recent VLAs, we nd that our alternative VLA adaptation design decisions empower ne-tuned OpenVLA policies to establish a new state of the art on the LIBERO benchmark.”
Quote in the paperSubstantial claim- Rests on an assumption: For satisfactory deployment, robot policies must demonstrate reliable task execution.
It may state two separate claims as one.
PremisereasoningThe ALOHA tasks are novel dexterous manipulation tasks that OpenVLA had never encountered during pretraining, which used only single-arm robot data.
“We evaluate on novel dexterous manipulation tasks that have never been encountered before during OpenVLA's pretraining (which only involves singlearm robot data).”
Quote in the paperSubstantial claimIt may state two separate claims as one.
InterpretationreasoningThese design choices work together to produce strong policies that can be deployed at high frequencies while keeping the algorithm simple.
“These design choices work together to produce strong policies that can be deployed at high frequencies while maintaining algorithmic simplicity.”
Quote in the paperSubstantial claimIt may state two separate claims as one.
PremisereasoningThe ALOHA setup differs substantially from OpenVLA's pretraining in control frequency, action space, and input modalities.
“This setup differs signi cantly from OpenVLA's pretraining, which includes single-arm robot data only, a single camera viewpoint from a third-person camera, no robot state inputs, low-frequency control (3-10 Hz), and relative end-effector pose actions.”
Quote in the paperSubstantial claimProbably not a substantial claim. The paper’s conclusions may not depend on it.
Study design and conductown dataOpenVLA results from this work were averaged over 500 trials per task suite, with 10 tasks and 50 episodes each.
“OpenVLA results from this work are averaged over 500 trials for each task suite (10 tasks 50 episodes).”
Quote in the paperNot a substantial claimIt may state two separate claims as one.
Interpretationown dataThe Optimized Fine-Tuning (OFT) recipe combines three components: parallel decoding with action chunking, continuous action representation, and an L1 regression objective.
“Based on the demonstrated improvements in task performance, inference ef ciency, and model input-output exibility, we propose anOptimized Fine-Tuning (OFT) recipe for VLA adaptation that combines three key components: 1) parallel decoding with action chunking 2) continuous action representation 3) L1 regression objective”
Quote in the paperSubstantial claimProbably not a substantial claim. The paper’s conclusions may not depend on it.
Study design and conductown dataThe evaluation used a predetermined rubric that assigned scores for partial task completion.
“To provide ne-grained assessment, we use a predetermined rubric that assigns scores for partial task completion (see Appendix F for details).”
Quote in the paperNot a substantial claim- Rests on an assumption: The predetermined rubric validly scores partial task completion.
Probably not a substantial claim. The paper may give no reason why it holds.
Interpretationnone givenThe alternative fine-tuning formulation, together with additional model inputs and outputs, creates a distribution shift between the base VLA's pretraining and fine-tuning.
“Given that the alternative ne-tuning formulation, along with additional model inputs and outputs, induces a distribution shift between the base VLA's pretraining and netuning, one reasonable question is whether the base VLA's pretrained representations are helpful and have any in uence on the results we have reported.”
Quote in the paperNot a substantial claim
The paper relies on this without support.
Vision-language-action models need fine-tuning to perform well on new robot setups.
“Despite these successes, VLAs struggle with novel robot setups and require finetuning to achieve good performance, yet how to most effectively fine-tune them is unclear given many possible strategies.”
The paper relies on this without support.
The best way to fine-tune vision-language-action models is not yet established because empirical analysis of fine-tuning recipes is limited.
“Despite the importance of fine-tuning for real-world VLA deployment, empirical analysis of effective fine-tuning recipes remains limited.”
The paper relies on this without support.
OpenVLA is a representative base vision-language-action model for studying adaptation design decisions.
“In this work, we study key design decisions for adapting VLAs to novel robots and tasks using OpenVLA, a representative autoregressive VLA, as our base model.”
The paper relies on this without support.
High-frequency bimanual robot control requires control frequencies of 25-50+ Hz.
“their analysis does not extend to bimanual robots with high control frequencies (25-50+ Hz), a more complex control scenario.”
The paper relies on this without support.
The LIBERO simulation benchmark and the ALOHA tasks are suitable for evaluating vision-language-action fine-tuning recipes.
“We evaluate on the LIBERO simulation benchmark [26], which features a Franka Emika Panda arm in simulation with demonstrations containing camera images, robot state, task annotations, and delta end-effector pose actions.”
The paper relies on this without support.
The three design components investigated are key for vision-language-action fine-tuning.
“To address these challenges, we investigate three key design components for VLA fine-tuning:”
The paper relies on this without support.
Efficient inference is crucial for deploying vision-language-action models on high-frequency control robots.
“Ef cient inference is crucial for deploying VLAs on highfrequency control robots.”
The paper relies on this without support.
For satisfactory deployment, robot policies must demonstrate reliable task execution.
“For satisfactory deployment, robot policies must demonstrate reliable task execution.”
The paper relies on this without support.
Real-time deployment of bimanual manipulation policies requires control frequencies of 25–50 Hz.
“falls well below the 25-50 Hz required for real-time deployment.”
The paper relies on this without support.
The four ALOHA tasks are representative of dexterous, bimanual manipulation tasks.
“We design four representative tasks testing deformable object manipulation, long-horizon skills, tool usage, and language-driven control:”
The paper relies on this without support.
The predetermined rubric validly scores partial task completion.
“we use a predetermined rubric that assigns scores for partial task completion”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Single-arm latency is reported in incompatible units
MinorThe related-work section claims a single-arm latency of 0.07 ms, but Table II reports about 0.073 seconds (73 ms) for the comparable parallel-decoding variants. That is roughly a thousandfold difference.
“0.07 ms for single-arm tasks with one input image and 0.321 ms for bimanual tasks with three input images”
“Throughput (Hz)" Latency (Sec)# LIBERO-Long SR (%) OpenVLA 4.2 0.2396 53.7 + PD 15.9 0.0629 + PD&AC 108.8 0.0735 86.5 + PD&AC, Cont-L1 109.7 0.0729 90.7”
Baseline single-action latency differs between text and table
MinorThe text gives 0.33 seconds for one OpenVLA action on an A100 GPU, whereas Table II lists 0.2396 seconds for the baseline on the same GPU.
“generating even a single-timestep action takes 0.33 seconds on an NVIDIA A100 GPU.”
“Throughput (Hz)" Latency (Sec)# LIBERO-Long SR (%) OpenVLA 4.2 0.2396 53.7”
Single-arm latency is stated in milliseconds but tabulated in seconds
MinorThe text claims roughly 0.07 milliseconds for a single-arm, one-image setup. Table II gives roughly 0.073 seconds for the corresponding one-image parallel-decoding variants-about 1,000 times longer.
“0.07 ms for single-arm tasks with one input image”
“Throughput (Hz)" Latency (Sec)# LIBERO-Long SR (%) OpenVLA 4.2 0.2396 53.7 + PD 15.9 0.0629 + PD&AC 108.8 0.0735 86.5 + PD&AC, Cont-L1 109.7 0.0729 90.7”
Citations
Cited by
Sorted by citations
Vision-Language-Action Models for Robotics: A Review Towards Real-World Applications
Kawaharazuka, K., Oh, J., Yamada, J., Posner, I., & Zhu, Y. (2025) · IEEE Access · doi:10.1109/access.2025.3609980 · Cited by 134
Embodied AI: A Survey on the Evolution from Perceptive to Behavioral Intelligence
Yifan, C., Wei, M., Wang, X., Liu, Y., Wang, J., Song, H., Ma, L., Di, D., Sun, C., Liu, K., et al. (2025) · SmartBot · doi:10.1002/smb2.70003 · Cited by 31
A Survey on Vision-Language-Action Models for Autonomous Driving
Jiang, S., Kong, M.-L., Tang, Y.-H., Sun, L., Qian, K.-G., Luo, Z., Zhu, T.-Z., Wang, Y.-L., Zhao, X., Wen, T., et al. (2025) · 2025 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw69036.2025.00476 · Cited by 114
Multimodal fusion with vision-language-action models for robotic manipulation: A systematic review
Din, M. U., Akram, W., Saoud, L. S., Rosell, J., & Hussain, I. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.104062 · Cited by 70
Bridging language and action: A survey of language-conditioned robot manipulation
Yao, X., Zhou, H., Mees, O., Meng, Y., Xiao, T. G., Bisk, Y., Oh, J., Johns, E., Shridhar, M., Shah, D., et al. (2026) · The International Journal of Robotics Research · doi:10.1177/02783649261468360 · Cited by 49
PI-VLA: Adaptive Symmetry-Aware Decision-Making for Long-Horizon Vision–Language–Action Manipulation
Jian, Y., Tian, D., Chen, X.-J., Wei, Z., Liang, C.-W., & Wang, M. (2026) · Symmetry · doi:10.3390/sym18030394 · Cited by 8
Embodied intelligence for robot manipulation: development and challenges
Song, H., Wang, L., Qiao, X., Chen, Y., Sun, D. M., & Sun, Z. (2025) · Vicinagearth. · doi:10.1007/s44336-025-00020-1 · Cited by 6
LaMP: Learning Vision-Language-Action Policy with 3D Scene Flow as Latent Motion Prior
Wang, X., Wang, C., Xu, Y., Ye, M., Zhang, F.-C., Tian, J., Zhan, X., Zhu, L., Lu, C., & Yang, L. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37013-6_13 · Cited by 18
Towards Generalizable Robotic Manipulation in Dynamic Environments
Fang, H., Li, S., Wang, S., Xi, X., Liang, D., & Bai, X. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37592-6_18 · Cited by 21
Li, Z., Liu, J., Dong, Z., Teng, T., Rouxel, Q., Caldwell, D. G., & Chen, F. (2025) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3678455 · Cited by 14
InteLiPlan: An Interactive Lightweight LLM-Based Planner for Domestic Robot Autonomy
Ly, K., Lu, K., & Havoutis, I. (2024) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3662577 · Cited by 12
BFA++: Hierarchical Best-Feature-Aware Token Prune for Multi-View Vision Language Action Model
Li, H., Mao, W., Lan, Z., Xiong, H., Wang, H., Si, C., Liu, Z., Deng, X., & Chen, H. (2026) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3673974 · Cited by 3
An MVUN-DP skill library-driven Embodied AI robotic assembly method with LLMs
Wang, Q., Liu, Y., Zhu, Z., Liu, S., Wang, Z., Zi, B., Wang, L., & Zhang, L. (2026) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2026.103263 · Cited by 1
Generation Models Know Space: Unleashing Implicit 3D Priors for Scene Understanding
Wu, X., Liang, D., Feng, T., Xia, K., Zhang, Y., Li, X., Tan, X., & Bai, X. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37235-2_15 · Cited by 12
RT-Cache: Training-Free Retrieval for Real-Time Manipulation
Kwon, O., George, A., Bartsch, A., & Farimani, A. B. (2025) · IEEE-RAS International Conference on Humanoid Robots (Humanoids) · doi:10.1109/humanoids65713.2025.11203198 · Cited by 4
Baki-Ul-Islam, Prioli, J. P. J., & Azucena, J. (2026) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2026.103360 · Cited by 1
Jiang, Y., Chen, X., Zhao, H., Liang, T., Liang, Y., & Ieong, C.-I. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11464271 · Cited by 1
RoboScape-R: Unified Reward-Observation World Models for Generalizable Robotics Training via RL
Tang, Y.-Z., Shang, Y., Chen, Y.-N., Wei, B., Zhang, X., Yu, S., Shi, L.-Z., Yu, C., Gao, C., Wu, W., et al. (2025) · 2026 IEEE/CVF Conference on Computer Vision and Pattern Recognition- FINDINGS Track (CVPRF) · doi:10.1109/cvprf71909.2026.00146 · Cited by 3
Vision-Language-Action Model Optimization for Real-Time Robotic Manipulation
Lin, J., Taherin, A., Akbari, A., Akbari, A., Lu, L., Chen, G., Padır, T., Yang, X., Srinivasa, J., Lin, X., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38404-1_23
LG-HSS: Language-Guided Hybrid Skill Scheduling for embodied manipulation
Si, X., Guo, Y., Chen, S., Pan, Y., Wang, T., & Gao, Y. (2026) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2026.105736 · Cited by 1
Restoring the Right Stream: Training-Free OOD Robustness for Vision–Language–Action Policies
Yan, Z., & Shen, G. (2026) · Entropy · doi:10.3390/e28090975
FEWT: Frequency‐Enhanced Wavelet‐Based Transformer for Multimodal Wheeled Bimanual Manipulation
Huang, J., Liu, H., Ma, Y., Shen, J., Zheng, Y., Wen, J., & Song, Z. (2026) · SmartBot · doi:10.1002/smb2.70058
Vision‐Language‐Action Models for Embodied Artificial Intelligence: A Comprehensive Survey
Xiong, N., Xu, M., Chen, W., Liu, J., Zhang, C., Wang, Y., & Yang, J. (2026) · Journal of Field Robotics · doi:10.1002/rob.70340
Systematic Literature Review of Vision-Language-Action Models for Generalist Robots
Cheema, U., Badr, Y., Le, T. M., & Fitzsimons, K. (2026) · Robotics · doi:10.3390/robotics15080160
NFH‐26‐03: Data‐efficient robot learning for contact‐rich manipulation
Seita, D. (2026) · AI Magazine · doi:10.1002/aaai.70074
Dynamic Context Adapters: Efficiently Infusing History into Vision-and-Language Models
Song, Y., Lin, B.-J., Liu, J., Chiu, T.-C., Nguyen, A., & Lee, C. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31663-9_8
Motion Smoothing and Continuity Enhancement for Real-World SmolVLA Deployment on Robotic Arm
Fu, Y., Wei, Y., Xie, Y., & Lin, C. (2026) · IEEE International Conference on Mechatronics and Automation (ICMA) · doi:10.1109/icma69663.2026.11647702
Poster: Task-Aware Dynamic Visual Token Pruning for Efficient Vision-Language-Action Inference
Lin, J., Sun, X., & Pang, W. (2026) · IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) · doi:10.1109/rtcsa71153.2026.00040
Online Failure Detection for Robot Manipulation with Time-Aware Metrics and Efficient Models
Ma, T., Fan, M., & Liu, W. (2026) · IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) · doi:10.1109/rtcsa71153.2026.00021
Bao, Q., 曹起瞳, Zhao, R., Dong, H., & Lu, Z. (2026) · International Conference on Intelligent Systems and Robotics (CISR) · doi:10.1109/cisr70722.2026.11680207
VTP: A Task-Aware Transmission Protocol for Edge Vision-Language-Action Robotic Systems
Huo, R., Wang, Y., Wu, Y., Dong, Y., & Yang, P. (2026) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc70295.2026.11680263
Fan, J., Huang, Z., Li, C., Wang, C., Zhang, Y., Wu, Y., & Li, Y. (2026) · Universe · doi:10.3390/universe12070199
Jeong, W., Gu, Y., Yi, J.-S., & Kim, H.-R. (2026) · International Conference on Ubiquitous Robots (UR) · doi:10.1109/ur69537.2026.11626770
XNav-Pipe: Cross-Platform Robot Navigation Data Generation Pipeline
Kim, S., Kim, M., Kim, S., Park, J., & Yu, Y. (2026) · International Conference on Ubiquitous Robots (UR) · doi:10.1109/ur69537.2026.11626805
Self-citationPhysical Reasoning VLA Models for Enhancing Robotic Manipulation
Kim, K., Lee, G., Lee, S., & Lee, K. (2026) · International Conference on Ubiquitous Robots (UR) · doi:10.1109/ur69537.2026.11626824
A Prompt-Driven Vision-Language Framework for Deictic Interpretation in Human-Robot Handover
Byeon, J., Ryu, S. M., & Park, K. M. (2026) · Actuators · doi:10.3390/act15060345
How can reasoning capability empower the AI copilot robot in endoscopic surgery
Wang, G.-K., Bai, L., & Ren, H. (2026) · npj Digital Medicine · doi:10.1038/s41746-026-02827-8 · Cited by 1
Yang, S., Bhat, S., Han, D. W., Salour, A., Stroup, T., Barakat, R., Pridham, P., Liu, Y., & Jessie, X. (2026) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3701124
BHGPT: Multiple AI Models for Built Heritage Knowledge Retrieval
Cui, C. D. L., Yan, W., Fioravanti, A., & Currà, E. (2026) · Rivista Tema · doi:10.36253/tema-16962
Zhao, X., Yan, L., Li, J., Wu, Y., & Tu, F. (2026) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca66397.2026.00188
Diffusion Models in Robotics: A Survey
Liu, X., Ma, K., Gao, C., & Shou, M. Z. (2026) · International Journal of Computer Vision · doi:10.1007/s11263-026-02893-1 · Cited by 1
Loss-robust split VLA inference framework toward real-time cloud-controlled robots: Proof of Concept
Majima, T., & Nishio, T. (2026) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom59046.2026.11571329
CARE: Multi-Task Pretraining For Latent Continuous Action Representation in Robot Control
Shi, J., Zhang, X., Qu, X., & Wang, J. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11460391 · Cited by 4
Box-Chain VLA: Explicit Reasoning-to-Action Interfaces for Generalizable Robotic Manipulation
Huang, H., Wan, L., Lu, J., Xiang, Y., Chen, A., Lu, K., Wang, R., & Chen, F. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11464640
Dynamic Maclaurin-Series-Based Vision-Language-Action Model
Yu, C., & Gan, Z. (2026) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3683324 · Cited by 1
A Hard Real-Time Bilateral Teleoperation System for High-Fidelity Robot Learning Data Collection
Khadka, S., & Pitkäaho, T. (2026) · International Conference on Control, Automation and Robotics (ICCAR) · doi:10.1109/iccar69571.2026.11549730
Scaling Vision–Language–Action Policy Adaptation via Action-Conditioned World Models
Yeboah, Y., Buertey, J. T. I., Agyapong-Kodua, K., Farisi, Z., & Brace, R. (2026) · International Conference on Mechatronics and Robotics Engineering (ICMRE) · doi:10.1109/icmre69538.2026.11533985
EvoVLA: Self-evolving Vision-Language-Action Model
Liu, Z., Yang, Z., Zhang, Z., & Tang, H. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37023-5_14 · Cited by 11
Fast-dVLA: Accelerating Discrete Diffusion VLA to Real-Time Performance
Song, W., Chen, J., Chen, S., Wang, J., Ding, P., Zhao, H., Qin, Y., Zheng, X., Wang, D., Wang, Y., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37013-6_20
Ma, S., Zhang, C., Wang, C., Wang, Y., Wu, Y., Wang, Z., Tian, J., Zhu, Z., & Tang, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37362-5_9 · Cited by 5
PolicyTrim: Boosting Intrinsic Policy Efficiency of Vision-Language-Action Models
Wang, X., Chen, F., Zhang, W., Yan, H., Wang, Z., Li, C., & Lei, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37271-0_6 · Cited by 3
Cui, R., Zhang, Z., Pang, J., Chi, H., Guo, J., Zhang, S., Xie, S., Jin, X., Mu, Y., Yang, J., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37627-5_28 · Cited by 16
Learning Transferable Dynamics Priors from Action to World Modeling
Huang, Z. Z., Zhang, J., Liu, H. X., Zhang, C., Cheng, R., & Zhang, L. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37550-6_25 · Cited by 7
Trust Your Instincts: Confidence-Driven Test-Time RL for Vision-Language-Action Models
Chen, S., Yuan, J., Wang, J., & Chen, T. X. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37592-6_28
Domain Arithmetic: One-Shot VLA Adaptation Under Environmental Shifts
Kang, T., Kim, T. J., Shin, D., & Choi, J. H. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37574-2_24 · Cited by 1
SegDiff: Segmented Trajectory Diffusion for Consistent and Adaptive Robot Manipulation
Cao, H., Cao, W., Li, Q., Xie, S., Du, Z., Leng, J., Wu, Z., & Jiang, Y.-G. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37577-3_36
IG-RFT: An Interaction-Guided RL Framework for VLA Models in Long-Horizon Robotic Manipulation
Su, Z., Kong, W., Dong, H., & Dong, H. (2026) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2026.3719668 · Cited by 7
Xu, C., Liang, Z., Zhang, Y., Chan, C.-M., Wang, J., Yang, X., Hu, M., Yang, X., & Mu, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37044-0_13
PARL-VLA: Pruning-Aware On-Policy Reinforcement Learning for Vision-Language-Action Model
Xu, R., Lv, J., Lin, S., Jin, R., He, S., & Liu, G. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37595-7_37
Landmark-Based Goal Recognition for Shared Autonomy: A Framework for Enhanced Teleoperation
Lorthioir, G., Benallegue, M., Cisneros-Limón, R., & Ramirez-Alpizar, I. (2025) · IEEE/RJS International Conference on Intelligent RObots and Systems · doi:10.1109/iros60139.2025.11245815 · Cited by 1
Integrating Agglomerative Perception With One-Step Action Generation for Robotic Manipulation
Wang, S., Wang, L., Huo, H., Zhou, S., Xia, K., & Hua, G. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3713027
StarVLA-$$\boldsymbol{\alpha }$$: Reducing Complexity in Vision-Language-Action Systems
Ye, J., Gao, N., Yang, S., Zheng, J., Wang, Z., Chen, Y., Chen, P., Chen, Y., Liu, S., & Jia, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37467-7_20 · Cited by 48
Yu, B.-Y., Peng, K., & Hsieh, J.-W. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37450-9_20
Bao, X., Ma, H., Ji, Y., Zheng, P., & Xia, L. (2026) · Procedia CIRP · doi:10.1016/j.procir.2026.02.165
Retrieval-VLA: Training-Free In-Context Adaptation for Vision-Language-Action Models
Zhang, Y., Wang, R., Lin, J., Wang, Z., & Qi, X. (2026) · 2026 IEEE/CVF Conference on Computer Vision and Pattern Recognition- FINDINGS Track (CVPRF) · doi:10.1109/cvprf71909.2026.00135
$A_{1}$: Adaptive Truncated Vision-Language-Action Model From Affordance to Action
Zhang, K., Zhang, J., Xu, R., Sun, Y., Wen, Y., Xue, S., Guo, X., Guo, M., Liufu, W., Zihou, L., et al. (2026) · 2026 IEEE/CVF Conference on Computer Vision and Pattern Recognition- FINDINGS Track (CVPRF) · doi:10.1109/cvprf71909.2026.00149
ProGAL-VLA: Grounded Alignment through Prospective Reasoning in Vision-Language-Action Models
Darabi, N., & Trivedi, A. (2026) · 2026 IEEE/CVF Conference on Computer Vision and Pattern Recognition- FINDINGS Track (CVPRF) · doi:10.1109/cvprf71909.2026.00865 · Cited by 1
Plug-and-Think: Structured Reasoning for Vision-Language-Action Models
Wei, K., Wen, D., Li, X., & Xiang, S. (2026) · doi:10.1109/cvprf71909.2026.00305
Akbar, W., Li, S., Hussain, A., Ullah, R., Waheed, N., Algarni, F., Ullah, I., & Jiang, W. (2026) · Internet of Things · doi:10.1016/j.iot.2026.102132
Kim, J., Lee, J., & Lee, J. (2026) · Mathematics · doi:10.3390/math14203677
SAFER: Incorporating Visual Context for Multitask Failure Detection in VLA Models
Tap, P., Abdurrahman, R. P., Sarıel, S., & Kalkan, S. (2026) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn69854.2026.11729608
Evolving embodied intelligence via reinforcement learning: challenges, barriers, and pathways
Ji, T., Sun, F., & Lv, L. (2026) · Science China Information Sciences · doi:10.1007/s11432-024-5010-x
Dinh, L. M. N., Nguyen, H. H., Ngo, T. Q., Duong, H. D., & Dao, T. T. (2026) · Robotics · doi:10.3390/robotics15100203
Lee, Y.-R., & Yang, S.-H. (2026) · International Conference on Advanced Robotics and Intelligent Systems (ARIS) · doi:10.1109/aris70457.2026.11734530
World models: Toward computationally usable embodied AI
Song, Y., Wang, J., Liu, H., Lin, L., & Song, J. (2026) · The Innovation Insights · doi:10.59717/j.tiis.2026.100018
EvalSpec: Executable Evaluation Contracts and Runtime Conformance for Action-Chunked Robot Policies
Liu, Z., Fan, X., Liu, B., Chen, T., & Wang, X. (2026) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2026.3745671
Metadata
- Authors
- Kim, M., Finn, C., & Liang, P.
- Venue
- Robotics: Science and Systems XXI
- Published
- 2025-06-21
- OpenAlex
- W4414050921
- Cited by
- 77
- References
- 0
- Citations by year
- 2026: 70 · 2025: 7
- FWCI
- 165.93
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Robotics: Science and Systems (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Robot Manipulation and Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
- Keywords
- vision-language-action models, robot control, fine-tuning, action chunking, parallel decoding, inference efficiency, OpenVLA, LIBERO benchmark, dexterous manipulation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-09-28, under version 3 of the claim definition (prompt extract-v3).
A second model labelled each claim on 2026-09-28 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review