Robot Wiki

Vision-Language-Action Models

RT-1, RT-2, RT-X, Octo, and OpenVLA: web-scale pretraining meets robot control, and the cost of discrete action tokens.

Last reviewed
Reading time
12 min
Citations
9

The modules so far covered policies trained from scratch on robot data alone: behavior cloning, ACT, and Diffusion Policy. The vision-language-action (VLA) line changes the starting point. Instead of training a policy from nothing, take a model that already understands images and language from web-scale pretraining, and teach it to emit robot actions. The design question that defines this lineage is how to get actions out of a model whose output space is text.

The interactive below is an illustrative seven-coordinate action sequence, not a recorded rollout or a literal tokenizer vocabulary. It places values in 256 uniform bins on a fixed normalized interval and uses synthetic token labels. Scrub the control step to inspect the assigned bin and reconstruction error. Quantization discards within-bin detail, but error can be zero when a value equals its reconstructed bin center. OpenVLA’s actual bin bounds use training-data quantiles; the toy does not estimate those statistics. Kim 2024

ΔxΔyΔzΔrollΔpitchΔyawgript=0t=5t=10t=15

Along the Δx action lane of the 16-step chunk, the continuous command runs from 0.183 at t = 0 to 0.183 at t = 15, and at the current step 7 the value -0.056 falls in bin 120 of 255; the 7 dashed rules are each dimension's zero line, and the chunk is a fixed synthetic example rather than measured robot data.

Sampled action value along the selected dimension
stepvaluebinplayhead
00.183151off
30.620207off
60.200153off
7-0.056120playhead
9-0.49664off
12-0.50763off
150.183151off
Δx axis, 256 uniform bins on [-1, 1]-11bin 113bin 120bin 127-0.056

On the Δx axis the continuous action -0.056 at step 7 falls in bin 120 of 255 and reconstructs to -0.0586 with quantization error +0.0025; the 256-bin strip is a uniform grid on [-1, 1], not a learned codebook.

Current bin assignment
dimension
Δx
step
7
action
-0.056
bin
120 of 255
reconstructed
-0.0586 (+0.0025)

Serialized action tokens at t = 7

1Δx<a120>2Δy<a141>3Δz<a108>4Δroll<a147>5Δpitch<a149>6Δyaw<a182>7grip<a19>

7 sequential decodes per control step: token n+1 cannot start until token n has been emitted.

Δx = -0.056 bin 120 of 255 <a120> reconstructs to -0.0586 (error +0.0025)

Illustrative seven-coordinate sequence: fixed [-1, 1] bounds and synthetic token labels, not a recorded rollout or literal vocabulary. The 256 bins illustrate per-coordinate quantization. RT-1 uses each variable’s bounds; OpenVLA uses the 1st and 99th training-data quantiles. RT-2 PaLI-X uses existing number tokens, while PaLM-E overwrites least-used tokens. The toy’s delta labels and 16-step sequence do not specify a universal robot controller.

RT-1: actions become tokens

RT-1 (2022) combines an ImageNet-pretrained EfficientNet with a pretrained instruction embedding and FiLM language conditioning. It tokenizes six images: TokenLearner reduces 81 visual tokens per image to eight, yielding 48 tokens for an eight-layer decoder-only transformer with 19M parameters. The paper reports 35M parameters for the full system. Brohan 2022

Its 11 action coordinates comprise seven arm variables (translation, rotation and gripper opening), three base variables (x, y and yaw), and a switch between arm control, base control and episode termination. Each variable is discretized into 256 bins uniformly spaced within its bounds; training uses categorical cross-entropy over action tokens. Brohan 2022

The paper reports roughly 130k training episodes covering more than 700 tasks, collected over 17 months with 13 robots, and 3,000 real-world evaluation trials. Its authors argue that generalization requires both scale and breadth, with sufficiently connected tasks to learn reusable patterns. That is their dataset argument, not a guarantee that pooling arbitrary demonstrations improves every task. Brohan 2022

256
bins per dim
uniform quantization
11
action dims
arm includes gripper; 3 base, 1 mode
~130k
episodes
700+ tasks, 13 robots
3 Hz
control rate
reported RT-1 robot setup

RT-1 reports a 3 Hz robot-control rate and predicts the next action rather than an action chunk. Its implementation uses a fixed wait after capturing the state to keep action timing consistent; Appendix C.1 gives 280 ms as the maximum observed latency of all components. These are settings of the reported system, not a universal limit on tokenized policies. Its visual and language encoders are pretrained, so describing the whole system as trained on robot data alone would also be misleading. Brohan 2022

RT-2: actions become text

RT-2 (2023) attacked the knowledge problem directly Brohan 2023. Rather than bolting a robot head onto a vision-language model, it expresses actions as strings in the VLM's existing vocabulary: each action dimension is discretized into 256 bins, and the bin indices are serialized into the token stream. The two backbones handle the vocabulary differently, which is a detail worth keeping: PaLI-X already has a token for every integer up to 1000, so bins map onto existing number tokens, while PaLM-E overwrites the 256 least frequently used tokens with the action vocabulary. The backbone (PaLI-X or PaLM-E, up to 55B parameters) is then co-fine-tuned on a mixture of robot trajectories and the original web vision-language data. The authors report that mixing the original web data with robot data during co-fine-tuning produces more generalizable policies than fine-tuning on robot data alone Brohan 2023.

RT-2 separates emergent object-choice behavior, such as selecting the smallest object or the one closest to another, from its additional chain-of-thought experiment. For the latter, the authors fine-tune a variant with an intermediate natural-language plan before the action tokens; their concrete example is “Instruction: I’m hungry. Plan: pick rxbar chocolate.” The abstract also gives choosing a rock as an improvised hammer as a multi-stage semantic-reasoning example. This is more specific than claiming that ordinary action decoding automatically supplies a reasoning trace. Brohan 2023

In their May 2025 research note, Danny Driess and colleagues at Physical Intelligence argue that this tokenized representation “is not suitable for high-frequency, precise, or fluent motions,” citing their π0 and π0-FAST experiments. Their analogy is “controlling your arm by verbally saying which muscles should contract.” This is the authors’ stated assessment of the representation, not an independently established impossibility result. Driess 2025

Open X-Embodiment and RT-X: pooling the data

Open X-Embodiment pooled more than one million real robot trajectories spanning 22 embodiments, 527 skills, and 160,266 tasks Open X-Embodiment Collaboration 2023. The report’s abstract names 21 contributing institutions; Section III-A separately describes 60 constituent datasets from 34 research labs. These differently labelled populations should not be treated as interchangeable counts. The RT-1-X and RT-2-X experiments used a nine-embodiment training subset, not all 22 embodiments. Transfer depended on the model and evaluation: RT-1-X improved over the original methods on four of five small-data domains but underperformed the domain-specific RT-1 baseline in the large-data setting. RT-2-X acquired additional Google Robot skills from WidowX Bridge data, while performing roughly on par with RT-2 on the tested unseen-object, background, and environment generalization. These results support cross-embodiment transfer in the evaluated settings, not a claim that every pooled model outperformed every single-embodiment baseline.

Data quality is a separate question from whether a particular pooled-training experiment shows transfer. In his October 2025 post, Moritz Reuss writes that “OXE is mostly low-quality data” and that “we still lack good methods to quantify data quality in imitation learning.” He presents the post as his personal selection and opinion. This is Reuss’s critique, not a demonstrated normalization artifact or a statement of community consensus. Reuss 2025

Octo and OpenVLA: the open models

Two 2024 releases made the VLA recipe reproducible outside Google.

Octo is a generalist robot policy with released 27M- and 93M-parameter checkpoints, trained on 800k Open X-Embodiment trajectories. Its language tokenizer separately uses pretrained T5-base (111M parameters). Observation and task tokens enter a block-wise-masked transformer; learned readout tokens attend to preceding inputs but do not influence those inputs through attention. A lightweight diffusion head maps the readouts to action chunks. Adding a sensor or output specification during fine-tuning can require new positional embeddings, a lightweight encoder or a new head, while retaining the transformer weights. It is not a promise that every new input requires no architectural work. Octo Model Team 2024

In its zero-shot WidowX evaluation, the paper reports a “25% higher success rate” with goal-image conditioning than with language conditioning. That is the paper’s wording; it must not be silently converted into a 25-percentage-point difference, since the paragraph does not give the underlying paired rates or explicitly label percentage points. The authors suggest that goal images convey more task information and identify better language conditioning as future work; they also note that only 56% of their pretraining data has language annotations. Octo Model Team 2024

OpenVLA builds on the Prismatic vision-language architecture with Llama 2 7B and fused DINOv2/SigLIP visual features. It is trained on 970k robot demonstrations and predicts seven action coordinates: position control, orientation control and gripper control. For each coordinate, 256 bins uniformly divide the interval between the training data’s 1st and 99th quantiles, rather than the observed minimum and maximum. Bin indices replace the 256 least-used Llama vocabulary entries and are predicted autoregressively. Kim 2024 Kim 2025

The v3 paper’s headline comparison reports a 16.5-percentage-point advantage in absolute task success over RT-2-X (55B), using the authors’ “7x fewer parameters” description. This is a comparison across 29 tasks on two embodiments: 17 WidowX tasks with ten trials each and 12 Google-robot tasks with five trials each, evaluated with matched initial robot and object states. It is not a general ranking across all robot tasks; the task definitions include partial credit in some cases. Kim 2024

The discrete-token throughput problem

OpenVLA’s original formulation predicts seven action tokens sequentially per timestep. That serial decoding is an inference cost, not a universal robot-control frequency. Kim 2025 RT-2’s authors report 1 to 3 Hz for the 55B PaLI-X variant and around 5 Hz for its 5B variant when querying their multi-TPU cloud service over the network. Brohan 2023 OpenVLA reports approximately 6 Hz inference on one RTX 4090 in bfloat16, without compilation or speculative decoding. Its separate Franka fine-tuning setups use 5 Hz and 15 Hz non-blocking controllers, and its quantization analysis explicitly discusses how slower inference changes controller dynamics. Do not substitute the 4090 inference figure for an executed rate on every robot. Kim 2024

Kim 2025 OpenVLA-OFT (2025) studies how to adapt OpenVLA, rather than showing that representation alone determines policy quality. Its recipe combines bidirectional parallel decoding, action chunking, continuous actions, and an L1-trained MLP action head. The ALOHA variant, OpenVLA-OFT+, also uses FiLM to strengthen language grounding.

The paper's LIBERO table reports 76.5% average success for the original fine-tuning recipe and 97.1% for OFT with an added wrist image and proprioceptive state. The average covers four ten-task suites; OFT is fine-tuned separately per suite, with 500 evaluation episodes per suite. The headline throughput result is a different input setting: on an A100, averaged over 100 one-image queries, L1 OFT generates 109.7 actions/s versus 4.2 for OpenVLA, about 26 times as many. With the added inputs used for the 97.1% result, throughput is 71.4 actions/s. These are action-generation rates, not robot-control frequencies. Kim 2025

The real ALOHA experiments use three images, robot state, and absolute joint targets at 25 Hz, reduced from the platform's original 50 Hz. OFT+ predicts and executes all 25 actions before replanning; LIBERO predicts and executes eight. The ALOHA tasks include folding clothes and language-directed scooping and object placement. They use partial-task-completion scoring, not the LIBERO binary-success protocol. Kim 2025

What the L1 ablation establishes

In the one-image LIBERO comparison with parallel decoding and eight-step chunks, L1 OFT averages 95.3% success across the four suites, versus 95.4% for the diffusion variant. On LIBERO-Long the figures are 90.7% and 91.1%; the latter uses 50 denoising steps. The paper trains diffusion variants longer and reports slower convergence and inference. Kim 2025

This is evidence about these fine-tuning experiments, not a general demonstration that diffusion's benefit comes from chunking. The authors use focused demonstrations with a consistent strategy per task and leave truly multimodal demonstrations and large-scale pretraining as open questions. Kim 2025

In ACT’s chunk-size ablation, the authors train separate policies for each chunk size with temporal ensembling disabled. Results average four settings: two simulated tasks, each with human or scripted demonstrations. The ACT curve rises from 1% at k=1 to 44% at k=100; those numbers are not the BC-ConvMLP baseline. Adding chunks also improves BC-ConvMLP and VINN in these settings. A separate ablation finds that removing ACT’s CVAE objective barely changes scripted-data results but lowers human-data success from 35.3% to 2%. Neither experiment establishes that probabilistic modeling is generally unnecessary. Zhao 2023

Where this leaves the field

These studies demonstrate particular transfers from web pretraining and pooled robot data, not universal improvement from scale alone. Their action interfaces, data mixtures, input modalities and execution protocols differ. Read the reported token-generation rates and robot-control rates separately, and compare results only with their task and evaluation settings attached. Brohan 2023 Kim 2024

A 2026 selection rule

Treat “VLA” as two decisions, not one model category. The first is the prior: which visual, language and robot experience the backbone brings to the task. The second is the control interface: what action the model emits, over what horizon, in which frame and at what measured rate. A large semantic prior can improve instruction following while a poor action interface still makes the system unusable at contact. OpenVLA-OFT is the clean example because changing the decoding and action head materially changed both throughput and success without replacing the underlying VLA Kim 2025.

Before choosing a checkpoint, write four rows: required semantic novelty, available embodiment data, action contract and latency budget. Use the foundation-model guide to select the prior family, then the action-space guide to specify the output. Only compare models after those two contracts match. Parameter count and benchmark average are weak selectors when one candidate cannot express the controller command or meet its deadline.

See also

  • The Pi Line

    pi0 to pi0.7: flow-matching action experts, FAST tokenization, open-world generalization, and source-scoped checkpoint availability.

  • Foundation Models for Robotics

    What foundation means in robotics, how VLA, world-model and multimodal pretraining differ, and what adaptation still costs.

  • Action Spaces for Robot Learning

    Joint, Cartesian, torque, impedance, chunked and tokenized actions: what each representation gives the learner and pushes onto the controller.

  • Comparison Matrix

    Every major policy across eight architectural axes: action representation, horizon, frequency, backbone, conditioning, cross-embodiment, hierarchy, openness.

Linked from

  • Diffusion Policy

    Visuomotor control as conditional denoising over action sequences, with receding-horizon execution.

  • The Pi Line

    pi0 to pi0.7: flow-matching action experts, FAST tokenization, open-world generalization, and source-scoped checkpoint availability.

  • Other Generalist Policies

    Gemini Robotics, GR00T, Helix, Skild, and GO-2: how to read closed-model vendor claims.

  • Comparison Matrix

    Every major policy across eight architectural axes: action representation, horizon, frequency, backbone, conditioning, cross-embodiment, hierarchy, openness.

  • Hierarchical Approaches

    SayCan, code-as-policies, and keypoint affordances; why separate planners gave way to internalized hierarchy.

  • Cross-Embodiment Transfer

    Padded action vectors, motion transfer, and shared relative end-effector frames; the live disagreement.

  • Knowledge Insulation

    Training the VLM backbone on discrete tokens while a flow-matching expert learns actions behind a stop-gradient.

  • Foundation Models for Robotics

    What foundation means in robotics, how VLA, world-model and multimodal pretraining differ, and what adaptation still costs.

  • Major Datasets

    Open X-Embodiment, DROID, BridgeData V2, AgiBot World, RoboMIND: five datasets compared.

References

  1. Anthony Brohan, Noah Brown, Justice Carbajal, Yevgen Chebotar, Joseph Dabis, Chelsea Finn, Keerthana Gopalakrishnan, Karol Hausman, and 43 more, 2022.

    https://arxiv.org/html/2212.06817v2

  2. Anthony Brohan, Noah Brown, Justice Carbajal, Yevgen Chebotar, Xi Chen, Krzysztof Choromanski, Tianli Ding, Danny Driess, and 46 more, 2023.

    https://arxiv.org/abs/2307.15818

  3. Open X-Embodiment Collaboration, Abby O'Neill, Abdul Rehman, Abhinav Gupta, Abhiram Maddukuri, Abhishek Gupta, Abhishek Padalkar, Abraham Lee, and 286 more, 2023.

    https://arxiv.org/abs/2310.08864

  4. Octo Model Team, Dibya Ghosh, Homer Walke, Karl Pertsch, Kevin Black, Oier Mees, Sudeep Dasari, Joey Hejna, and 12 more, 2024.

    https://arxiv.org/html/2405.12213v2

  5. Moo Jin Kim, Karl Pertsch, Siddharth Karamcheti, Ted Xiao, Ashwin Balakrishna, Suraj Nair, Rafael Rafailov, Ethan Foster, and 10 more, 2024.

    https://arxiv.org/abs/2406.09246

  6. Moo Jin Kim, Chelsea Finn, Percy Liang, 2025.

    https://arxiv.org/abs/2502.19645

  7. Danny Driess, Jost Tobias Springenberg, Brian Ichter, Lili Yu, Adrian Li-Bell, Karl Pertsch, Allen Z. Ren, Homer Walke, and 3 more, 2025.

    https://www.pi.website/research/knowledge_insulation

  8. Moritz Reuss, 2025.

    https://mbreuss.github.io/blog_post_iclr_26_vla.html

  9. Tony Z. Zhao, Vikash Kumar, Sergey Levine, Chelsea Finn, RSS 2023.

    https://arxiv.org/abs/2304.13705

Spot a factual error or missing qualification? Report a content correction.