Vibe Engines is free, interactive AI engineering & system design — runs in your browser. Pick a learning path →
RT-2,
explained.
A robot that has never once picked up a banana in training reaches out and picks up the banana. How? RT-2's trick is almost cheeky: it makes controlling a robot the exact same task as writing a sentence. Chop each motor command into bins, call each bin a word, and now a giant vision-language model — one that already learned what a banana is from the web — can just "say" the action. Web knowledge pours straight into the gripper. Here's how actions became tokens, and why that one move unlocks robots that generalize.
What changes against every rung below: the output is an action
Rungs 1 to 6 connect modalities to understanding. This rung connects one to acting, and the problem it solves is a mismatch of type. A vision-language model emits text tokens. A robot needs continuous numbers — displacements, rotations, a gripper state. The conventional answer is a separate policy network trained on robot data, which means the control policy learns nothing from the web and knows only the objects in its own small dataset.
The change is almost a trick, and it is the rung. Discretise the action into bins and express those bins as tokens the model's vocabulary already contains. An action becomes a short string. So controlling a robot is text generation, the architecture needs no new output head, and — the part that matters — the model can be trained on robot trajectories and web image-text data together, because both are now the same kind of sequence.
What that buys, stated in units the ladder cares about, is semantic generalisation into control. The model can act on an instruction mentioning an object that appears nowhere in the robot data, because it learned what the word means from the web and the action vocabulary is shared. A policy trained only on robot demonstrations cannot do that at any scale of demonstrations, because the knowledge is simply not in them.
Actions as words
Robot learning has a data problem the rest of AI doesn't: you can't scrape robot trajectories off the internet. Every demonstration is collected on real hardware, slowly, so robot datasets are tiny next to the web. The result is brittle policies that work only on the exact objects and phrasings they were trained on. Meanwhile, vision-language models trained on the whole internet know an enormous amount about the world — but they can't move a single motor.
RT-2's insight is to fuse the two by making them speak the same language. It takes a large vision-language model and gives it one new thing to say: actions. A robot action is turned into a short string of tokens, drawn from the model's own vocabulary, so producing an action is generation — exactly like producing a caption. Because it's the same model and the same token space, everything the model learned from the web is instantly available when it decides what the robot should do.
Discretize each robot action into tokens from the model's vocabulary, so a web-pretrained vision-language model can emit actions like words — and its internet knowledge transfers straight to control.
Tokenizing a motion
A single robot command is a small vector of continuous numbers — a common choice is 7-DoF: three position deltas, three rotation deltas, and one gripper open/close. To make this a string of tokens, RT-2 discretizes each dimension: split its range into a fixed number of bins (say 256), and map the value to the index of the bin it falls in. Each bin index is assigned a token, so an action of seven continuous numbers becomes seven tokens — one per dimension — and with the leading end-of-episode flag the model emits eight in all.
At inference the model generates these action tokens autoregressively, and they're decoded back to continuous values by mapping each token to its bin's center. The whole action interface is just a fixed vocabulary of bins bolted onto the language model's — no new prediction head, no separate control network. Control has been rewritten as sequence generation.
Co-train on the web
Because actions are tokens, RT-2 can be trained on a mixture of two very different data sources at once: internet vision-language data (image captioning, visual question answering) and robot trajectories (image + instruction → action tokens). This co-fine-tuning is the crux. The web data keeps the model's vast semantic knowledge alive and sharp; the robot data teaches it to ground that knowledge in motor commands. Crucially they share every weight — there's no separate module where knowledge could get stranded.
The consequence is transfer. When the model sees "pick up the extinct animal" next to a toy dinosaur, it doesn't need a robot demo of that exact task — it already knows from the web what "extinct animal" means and which object matches, and it can route that understanding into action tokens. The robot dataset never contained dinosaurs; the web did. That's why co-training on shared tokens, rather than bolting a controller onto a frozen model, is what makes the semantics flow all the way to the gripper.
Bins and precision
The tokenization is exact arithmetic. Split a dimension's range [lo, hi] into B bins; the value x maps to bin index and back to that bin's center:
Δ is one bin width. Every value in a bin decodes to the same center, so decoding is lossy by up to half a bin.
That rounding is the only cost, and it's bounded. The worst-case round-trip error is half a bin width, which shrinks as you add bins — buying finer motor precision at no change to the token count:
Still one token per dimension regardless of B — more bins mean a finer action alphabet, not a longer action string. A few hundred bins is precise enough for manipulation, so the tiny quantization cost buys the enormous benefit of sharing the language model's token space. The runnable version below tokenizes a 7-DoF action and shows the error shrinking with more bins.
How RT-2 turns a vision-language model into a robot policy
RT-2 adds no new network. It takes two existing vision-language models, writes robot actions as text in their vocabularies, and fine-tunes them on robot demonstrations mixed with their original web data, producing what the paper calls a vision-language-action model.
- Pick the backbones. PaLI-X, in 5-billion and 55-billion-parameter versions, and PaLM-E at 12 billion. Each encodes the camera image with a Vision Transformer and feeds the resulting tokens, together with the text, to a language model that generates text.
- Define the action. The robot is commanded in end-effector space: a 6-DoF change in position and rotation, the extension of the gripper, and a discrete command that ends the episode.
- Discretize. Each continuous dimension is split into 256 uniform bins, so one action becomes 8 integers: the end flag, then the bin indices of the seven continuous values.
- Map bins to tokens. PaLI-X's tokenizer already has a single token for every integer up to 1,000, so bin k is simply the token for k. PaLM-E has no such tokens, so its 256 least frequently used tokens are reassigned as the action vocabulary.
- Ask it as a question. Each robot example pairs a camera image with the prompt “Q: what action should the robot take to [instruction]? A:” and expects the 8 integers, separated by spaces, as the answer.
- Co-fine-tune. The robot data, RT-1's demonstrations collected by 13 robots over 17 months in an office kitchen, is mixed with the backbone's original web vision-language data: robot examples make up about half of the PaLI-X mixture and about two-thirds of the PaLM-E one.
- Constrain decoding. When the prompt is a robot-action task, sampling is restricted to valid action tokens, so every output decodes to an executable command; on ordinary visual questions the full vocabulary stays open.
- Run the loop. At each step the current image and the instruction go in, 8 tokens come out, each is mapped back to its bin's center, and the arm moves. The models are served from a multi-TPU cloud service and queried over the network: 1–3 Hz for the 55B model, about 5 Hz for the 5B model.
- Optionally, plan first. A PaLM-E variant was fine-tuned briefly on data with a short natural-language plan before the action tokens, which let it handle commands that need a step of reasoning, such as choosing a rock to use as an improvised hammer.
What the action string costs
The real cost of writing actions as text is time. The 8 tokens are generated one after another by a model with billions of parameters running in a remote data center, so control runs at a few hertz: RT-1, with 35 million parameters, ran at 3 Hz, and the 55B RT-2 at 1–3 Hz. Later vision-language-action models attacked exactly this. π0, for example, keeps a pretrained VLM but adds a separate flow-matching action expert that outputs continuous chunks of 50 future actions, controlling robots at up to 50 Hz without discretizing anything.
RT-2's co-fine-tuning objective and constrained decoding
a— one command; the end flag is already discrete, and the other seven values are binnedsk— the token for dimension k: an integer token in PaLI-X, a reassigned rare token in PaLM-ELweb— the ordinary next-token loss on the backbone's captioning and question-answering dataλ— the robot share of the training mixture: about 0.5 for PaLI-X and 0.66 for PaLM-Eθ— the model's weights, shared by both kinds of data
At the extremes: λ = 1 is plain fine-tuning on robot data, which the paper found generalized worse to new objects and scenes than co-fine-tuning; keeping web data in the mix keeps the model's broader visual knowledge in use while it learns control. λ = 0 learns no control at all. Training the same architecture from scratch on robot data, with no web pretraining, did very poorly. And without the restriction at inference, the model could emit a word in an action slot, which maps to no bin and cannot be executed.
Six thousand robot trials: what RT-2 changed
The evaluation ran about 6,000 trials on real robots. The baselines were RT-1 (35 million parameters, trained only on the robot data), VC-1 and R3M (pretrained visual representations feeding an RT-1-style policy), and MOO (an open-vocabulary object detector plus a policy). Tasks were split into those seen in training and unseen ones with new objects, backgrounds or environments, plus emergent tasks that need web knowledge: symbols, reasoning and recognizing people.
| Evaluation | Result |
|---|---|
| Seen tasks | RT-2 comparable to RT-1 |
| Unseen objects, backgrounds, environments: average success | RT-2-PaLI-X-55B 62%, MOO 35%, RT-1 32%; about 6× VC-1 and R3M |
| Emergent skills: symbols, reasoning, people | more than 3× the average success of the next-best baseline, RT-1 |
| Language-Table simulation | a 3B RT-2 model outperforms the baselines |
| Control rate | 1–3 Hz (55B), about 5 Hz (5B) |
Examples of the emergent category include moving an object onto a particular number or icon, or toward a pictured celebrity or a person wearing glasses, none of which appear in the robot data. The ablations isolate where that comes from: the same PaLI-X architecture trained from scratch on robot data performed very poorly, fine-tuning a pretrained model on robot data alone generalized worse than co-fine-tuning with web data, and the 55B model generalized better than the 5B.
The limits are stated plainly. RT-2 learns no new motions: its physical skills are the ones in the robot data, deployed in new semantic situations. And the large models are expensive enough that their control rate may bottleneck tasks that need fast reactions.
What the authors admit, and what happened next
What transfers is semantic and not physical, and the paper is clear about the boundary. Web pre-training teaches the model what a banana is and that a wet floor is slippery as a fact; it does not teach the manipulation skill required to pick up something it has never handled. New physical competence still needs robot data, which remains the scarce resource and is the real bottleneck in the field.
Latency is the other hard constraint and it is structural: a large model in a closed control loop must produce each action within the time the controller allows, and model size trades directly against control frequency. Discretisation itself costs precision — a binned action is a quantised action, and fine manipulation feels that.
How it held up: it established vision-language-action models as a category, and actions-as-tokens is the standard trick in it. The broader lesson generalises past robots: if you want a pretrained model's knowledge to reach a new output space, the cheapest route is often to express that space in the model's existing vocabulary rather than to bolt on a new head — the same move as expressing every task as text on the scaling ladder.
Turn a motion into tokens
RT-2's action interface is just quantization. Discretize each dimension of a robot command into bins, and each bin index is a token from the model's vocabulary — so a 7-DoF action becomes 7 tokens (8 with RT-2’s end flag), generated like words and decoded back to bin centers. The only cost is rounding: the worst-case round-trip error is half a bin width, and doubling the bins halves it, at no change to the token count. Clamping keeps every token a valid vocabulary index. Change the bins or the action and watch the tokens and the precision move.
Write the body of discretize. Everything else in the file is
already written; this is the function the paper is about. Press ▶ Run to check it against
the 5 assertions below — they start red.
- Discretize maps the low end to bin 0 and clamps into range
- Round-trip error is bounded by half a bin width
- One action token per action dimension
- More bins give finer control (smaller quantization error)
- Clamping keeps every action token a valid vocab index
The VLA era
RT-2 named and popularized the Vision-Language-Action (VLA) model — a single network that maps pixels and language directly to actions — and it made the case that the fastest route to capable robots runs through internet-scale pretraining, not around it. The action-as-token recipe turned robotics into another sequence-modeling problem, so the whole toolkit and scaling curve of large models became available to control. A wave of open VLAs followed the same blueprint.
The deeper lesson echoes Sora's: find the right "token" for your modality and a transformer will learn over it. For video it was the spacetime patch; for control it's the discretized action. Once an action is a token, the boundary between "understanding the world" and "acting in it" gets thin — the same weights that answer a question about an image can command a gripper. RT-2 is the clearest demonstration that robot generalization can be, in large part, inherited rather than collected.
The transfer only happens because of co-training. If you froze the vision-language model and trained a separate action head, the web knowledge would stay locked in the frozen weights. Sharing every weight — and the token space — is what lets "extinct animal" reach the gripper.
Questions people ask about RT-2
How does RT-2 tokenize robot actions?
Each action is 8 integers. The command covers the end effector's 6-DoF change in position and rotation, the gripper's extension and a discrete flag that ends the episode; the seven continuous values are each split into 256 uniform bins, so the action becomes the end flag followed by seven bin indices, written as text separated by spaces. In PaLI-X every integer up to 1,000 already has its own token, so bin k is simply the token for k. PaLM-E lacks such tokens, so RT-2 overwrites its 256 least frequently used tokens. At inference, sampling is restricted to the action tokens, and each one is decoded back to its bin's center.
What is the difference between RT-1 and RT-2?
RT-1 is a 35-million-parameter Transformer trained on robot data alone: an ImageNet-pretrained EfficientNet conditioned on the instruction compresses each of the last six camera images to 8 tokens, and the model outputs discretized actions at 3 Hz. RT-2 replaces it with a vision-language model of up to 55 billion parameters, pretrained on web data and co-fine-tuned on the same robot demonstrations, writing actions as text tokens in its own vocabulary. On seen tasks the two perform comparably. On unseen objects, backgrounds and environments RT-2's average success was 62% against RT-1's 32%, and on tasks that need web knowledge, such as symbols or reasoning, it scored more than three times higher. The price is speed: 1 to 3 Hz for the 55B model.
What is a vision-language-action (VLA) model?
A VLA model is a single network that takes camera images and a natural-language instruction and outputs robot actions directly, built from a vision-language model pretrained on web-scale image and text data. RT-2 introduced the term. Its recipe is to express actions in the model's own token vocabulary and co-fine-tune on robot demonstrations together with the original web data, so knowledge from the web, such as what an extinct animal is or which object is smallest, can shape what the robot does. Later VLAs kept the pretrained backbone but varied the output: OpenVLA is an open 7B model in the same token style, while π0 generates continuous action chunks with a flow-matching head.
How fast does RT-2 run on a real robot?
Slowly by control standards. The paper serves the models from a multi-TPU cloud service that the robot queries over the network, and reports 1 to 3 hertz for the 55-billion-parameter model and around 5 hertz for the 5-billion-parameter version. Each step generates 8 action tokens one after another, on top of encoding the image, so model size trades directly against control frequency. RT-1, with 35 million parameters, ran at 3 Hz. The authors list computational cost as a limitation for tasks that need high-frequency control, and later vision-language-action models such as π0 moved to predicting chunks of continuous actions at once, reaching control rates of up to 50 Hz.
Why does RT-2 co-fine-tune on web data instead of only robot data?
Because robot data alone teaches control but not the world. In the paper's ablations, the same architecture trained from scratch on robot demonstrations performed very poorly; starting from a pretrained vision-language model and fine-tuning only on robot data did much better; and co-fine-tuning, which keeps the original web captioning and question-answering data in the training mixture, generalized best to unseen objects, backgrounds and environments. Robot examples made up about half of the PaLI-X mixture and about two-thirds of the PaLM-E one. Since actions and words share one vocabulary, nothing in the architecture separates the two kinds of training; the mixture simply keeps the web knowledge in use while control is learned.
4 questions to test what you just read
Work each one out before you open it — a number, a prediction or a reason, not a definition. Producing the answer is what makes it stick. Your progress is kept on this device.
A task takes 30 seconds and the 55B model runs at 2 Hz. How many forward passes and action tokens is that, and roughly how long can each token take?
Show answer
30 × 2 = 60 steps, × 8 = 480 action tokens. Each step has 500 ms for image encoding, the network round trip and 8 sequential tokens, so well under 60 ms per token. At 3 Hz the budget per step shrinks to about 333 ms.
PaLM-E has no tokens for the integers 0 to 255, so RT-2 reassigns its 256 least used tokens. What is the side effect, and why does PaLI-X avoid it?
Show answer
Whatever those rare tokens meant is overwritten, so the model loses them for text, a small cost precisely because they were rare. PaLI-X already has one token per integer up to 1,000, so bin k is the existing token for k: no vocabulary is sacrificed, and the action tokens are numbers the model already knows.
How would you rank training from scratch on robot data, fine-tuning on robot data only, and co-fine-tuning with web data by generalization to unseen objects, and why?
Show answer
From scratch is worst, robot-only fine-tuning next, co-fine-tuning best. From scratch has no web knowledge at all. Fine-tuning starts with it but then trains only on a narrow robot dataset. Co-fine-tuning keeps web data in the mixture, so the model's knowledge of objects and concepts stays in use while it learns to map them to motions.
Suppose RT-2 is told to pick up 'the extinct animal' from a table of toys and picks the toy dinosaur. Which part of that ability comes from the web, and which from the robot data?
Show answer
The web supplies the meaning: that a toy dinosaur counts as an extinct animal, and which object in the image it is. The robot data supplies the skill: how to reach and grasp an object on that table. RT-2 combines the two, but it cannot invent a motion; the paper is explicit that its physical skills are limited to those in the robot data.
One model, many senses
Joining text to images, audio, video and finally to a robot arm. Starts with the contrastive objective the whole field standardised on.
Explore the topic
See this alongside everything else on the same subject — handbooks, system designs, challenges and tools, in one place.
More Paper Breakdowns
- Attention Is All You NeedThe paper that introduced the Transformer — the architecture underneath GPT, BERT, Claude, and Gemini. Self-attention, Query/Key/Value, multi-head attention, positional encoding, and the real BLEU results, explained in depth with analogies and animated visuals, not just equations.Read →
- Word2VecHow words became math. Dense word vectors learned from the company a word keeps, so king − man + woman lands near queen. Skip-gram, CBOW, the distributional hypothesis, and the origin of every embedding model powering search and RAG.Read →
- ResNetThe skip connection that made deep learning deep. Why stacking layers made networks worse, and how residual learning let them reach 150+ layers and win ImageNet — the identity shortcut every Transformer still uses inside every block.Read →
- Vision Transformer (ViT)When an image became 16×16 words. Cut a picture into patches, treat each patch as a token, and feed them to a plain Transformer — no convolutions. Patch embeddings, the class token, and why data scale lets attention beat the CNNs that ruled computer vision for a decade.Read →
- Latent DiffusionThe paper behind Stable Diffusion. Compress an image into a small latent space with a VAE, run the diffusion denoising there instead of on pixels for a tens-of-times efficiency win, and steer it with text via cross-attention. The architecture that put text-to-image generation on consumer GPUs.Read →
- DDPMThe original denoising diffusion math — the paper that made diffusion work. A fixed forward process adds Gaussian noise over many steps; a U-Net learns the reverse. The masterstroke: train the network to simply predict the added noise with a plain MSE loss. The foundation under every modern image generator.Read →