Cited by 77Robot Manipulation and LearningReinforcement Learning in RoboticsMultimodal Machine Learning Applications

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 access
Kim, Moo, Finn, Chelsea, Liang, Percy·2025·Robotics: Science and Systems XXI

Abstract

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

Crossref · 10.15607/rss.2025.xxi.017

Cites

Statistics

Nothing to recompute.

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.
  • It may state two separate claims as one. 35
  • Probably not a substantial claim. 11
  • It may state two separate claims as one.

    Findingown data

    Parallel 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 data

    Policies 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 claim
  • It may state two separate claims as one.

    Findingown data

    The 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 data

    In 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 data

    The 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 data

    Parallel 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 data

    OpenVLA-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 data

    In 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 data

    Parallel 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 claim
  • It may state two separate claims as one.

    Findingown data

    Fine-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 data

    Despite 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 data

    Executing 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 data

    ACT 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.

    Findingcitation

    Fine-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.

    Interpretationreasoning

    For 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 claim
  • It may state two separate claims as one.

    Interpretationreasoning

    L1 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 claim
  • It may state two separate claims as one.

    Interpretationown data

    The 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.

    Interpretationreasoning

    Language 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 claim
  • It may state two separate claims as one.

    Interpretationcitation

    The 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 claim
  • Probably not a substantial claim.

    Premisecitation

    OpenVLA 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.

    Interpretationreasoning

    Conditional 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 claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Premisecitation

    LoRA 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.

    Premisecitation

    Existing 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.

    Premisecitation

    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.

    “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 data

    Parallel 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.

    Interpretationreasoning

    For 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 claim
  • It may state two separate claims as one.

    Interpretationreasoning

    Feature-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.

    Premisereasoning

    Diffusion-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 claim
  • Probably not a substantial claim. It may state two separate claims as one.

    Interpretationreasoning

    Parallel 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 claim
  • Probably not a substantial claim.

    Interpretationreasoning

    The 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 claim
  • It may state two separate claims as one.

    Interpretationcitation

    Action 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 data

    The 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.

    Premisecitation

    Both 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.

    Interpretationcitation

    The 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.

    Premisecitation

    Action 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.

    Premisecitation

    OpenVLA 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 data

    Even 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.

    Premisereasoning

    The 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 claim
  • It may state two separate claims as one.

    Interpretationreasoning

    These 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 claim
  • It may state two separate claims as one.

    Premisereasoning

    The 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 claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Study design and conductown data

    OpenVLA 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 claim
  • It may state two separate claims as one.

    Interpretationown data

    The 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 claim
  • Probably not a substantial claim. The paper’s conclusions may not depend on it.

    Study design and conductown data

    The 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 given

    The 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
44 of 44
  • 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”
11 of 11

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

    Minor

    The 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.

  • Baseline single-action latency differs between text and table

    Minor

    The 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.

  • Single-arm latency is stated in milliseconds but tabulated in seconds

    Minor

    The 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.

3 of 3

Citations

Cited by

Sorted by citations

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
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