Robot Wiki

Foundation Models for Robotics

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

Last reviewed
Reading time
6 min
Citations
8

“Foundation model” is a claim about reuse, not a synonym for a large neural network. In robotics, the useful test is whether one pretrained model supports materially different downstream tasks, environments or embodiments after bounded adaptation. Parameter count alone does not establish that property, and a model trained across many tasks can still be a closed, fixed policy rather than a foundation for new ones.

Three families currently carry the label: vision-language-action models that emit controls, predictive world models used for planning or representation learning, and multimodal backbones adapted into either. They share pretraining scale and diverge at the output interface.

Try the check below and choose the evidence that actually supports the foundation claim. The correct option requires transfer to a downstream setting rather than only a large training run.

Self-check

Which result is the strongest evidence that a robot model is functioning as a foundation model?
Read the reasoning
  • The checkpoint contains seven billion parametersScale may increase capacity, but it says nothing by itself about reuse or adaptation. A seven-billion-parameter specialist remains a specialist.
  • The model memorizes a thousand training task labelsTraining breadth is relevant, but success on the training distribution does not demonstrate transfer. The claim needs a downstream setting that was not simply another row in the training set.
  • One checkpoint adapts with limited data to new tasks and embodimentsThis is the operational evidence. The shared pretrained representation reduces the data or optimization required across genuinely different downstream settings.

Judge foundation models by the breadth and cost of downstream reuse, not by parameter count or branding.

What must be specified

A foundation-model claim is incomplete until it names four things:

  1. Pretraining data: web images and text, human video, robot trajectories, simulation or a mixture.
  2. Pretraining objective: next token, contrastive representation, video prediction, action denoising or another loss.
  3. Downstream interface: text, an action chunk, a predicted future, a value or a reusable embedding.
  4. Adaptation budget: zero-shot prompting, a linear probe, parameter-efficient tuning, full fine-tuning, or new robot data at scale.

Those fields turn a label into a testable object. They also explain why two “robotics foundation models” can have little technical overlap.

VLA foundations: knowledge becomes action

RT-2 established the central VLA argument: co-fine-tune a web-pretrained vision-language model on robot trajectories, express actions in its token vocabulary, and some semantic knowledge transfers into control Brohan 2023. OpenVLA made a comparable recipe public, combining DINOv2 and SigLIP visual features with a LLaMA-family language backbone and fine-tuning on Open X-Embodiment Kim 2024.

The pretrained asset here is semantic representation. It helps a robot interpret language and recognize concepts that are scarce in robot data. It does not supply embodiment-specific calibration, gripper dynamics, control rate or task success labels. Those enter during adaptation.

The π0 line changed the action side. π0 uses a pretrained VLM plus a separate flow-matching action expert that generates continuous action chunks Black 2024. The separation lets the semantic backbone and motor head operate at different widths and objectives. Later work made the design principle explicit as knowledge insulation: preserve the VLM's web knowledge while the action expert learns the high-frequency control distribution Driess 2025.

By 2026, π0.7 framed the same line as a steerable generalist robotic foundation model, with high-level steering signals and broader downstream behavior Ai 2026. The relevant evidence is not the phrase in the title. It is whether the same pretrained system produces useful transfer under stated adaptation budgets and held-out physical conditions.

Humanoid foundations: embodiment is part of the bet

GR00T N1 is an open foundation model aimed specifically at generalist humanoids. It combines a vision-language backbone with a diffusion-transformer action head and trains across real, simulated and synthetically generated trajectories NVIDIA 2025. Its foundation scope is narrower than “all robots” and broader than one humanoid task.

That distinction matters. A foundation can be domain-specific. Protein models, code models and robot models do not need to share an output space. The honest claim names the domain over which reuse has been demonstrated. For a humanoid model, morphology, whole-body balance and shared action coordinates are not incidental details; they define the reuse boundary.

Predictive foundations: represent or simulate the future

World-model families pretrain a different capability. V-JEPA 2 learns predictive representations from more than a million hours of video, then adds an action-conditioned predictor with a much smaller quantity of robot video for planning Assran 2025. The transferable asset is a representation in which future states can be predicted and compared, not a direct language-to-action map.

Cosmos 3 unifies understanding, generation, forward dynamics, inverse dynamics and policy-oriented outputs in an omnimodal model for physical AI NVIDIA 2026. Its scale supports several downstream roles, but each role still needs an evaluation suited to that output. A visually convincing future is not automatically a useful control model; world-model evaluation measures action sensitivity and policy-ranking utility directly.

The world-model taxonomy separates generative video, latent dynamics, JEPA and unified world-action systems. Grouping them only by scale hides the functional differences that determine whether a model can plan, train a policy or generate data.

What pretraining does not erase

Foundation models reduce some marginal costs and leave others untouched.

They can reduce:

  • semantic supervision for new language and object concepts;
  • representation learning from small robot datasets;
  • initialization cost across related tasks;
  • the need to train one visual backbone per policy.

They do not automatically reduce:

  • the need for synchronized, correctly transformed actions;
  • calibration and control integration on a new robot;
  • closed-loop evaluation under physical perturbations;
  • inference latency and memory constraints;
  • safety cases and recovery behavior.

The remaining costs explain why open weights are not the same as a deployable robot policy. A checkpoint can be downloadable while its training mixture, adaptation data, controller assumptions or benchmark protocol remain impossible to reproduce.

A comparison framework

FamilyPretrained capabilityTypical downstream outputStrongest transfer claimMain unresolved cost
VLAVision-language semanticsAction tokens or continuous chunksNew tasks, objects and instructionsRobot data and control integration
Generalist humanoidMultimodal behavior across a morphology familyWhole-body action chunksTasks and related humanoid embodimentsBalance, contact and hardware variation
Latent or JEPA world modelPredictive state representationLatent future, value or planNew tasks with shared dynamics structurePlanning objective and action grounding
Generative world modelVisual and temporal generationFuture video or synthetic experienceData generation and policy evaluationPhysical fidelity and inference cost

Compare systems within the same row before comparing across rows. A VLA success rate and a world model's video metric do not answer the same question.

How to evaluate a foundation claim

Look for a matrix, not a highlight. Rows should vary tasks and environments; columns should vary embodiment, adaptation data and evaluation shift. Report the pretrained checkpoint, every tuned component and the amount of new robot interaction. Include a from-scratch baseline under the same data budget.

Then ask what failed. If transfer collapses when camera placement changes, the representation is less foundational than the task list suggests. If a new arm needs full retraining on a large dataset, the model may be a strong multi-task policy with a narrow embodiment boundary. If a small adapter works across genuinely new tasks, the foundation description has earned useful meaning.

The term is valuable when it predicts engineering leverage. Used precisely, it tells you which expensive capability has already been learned and which expensive capability you still have to supply.

See also

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

  • Other Generalist Policies

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

  • What Is a World Model?

    An editorial comparison of six world-model example groups: what they predict, in what representation, and for what purpose. The survey-defined functional criterion is decision-relevant prediction, not visual plausibility alone.

  • Cross-Embodiment Transfer

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

Linked from

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

  • Comparison Matrix

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

  • Robot Learning Curriculum for ML Engineers

    A dependency-aware route from supervised learning to real robot policies, with the minimum robotics stack each stage assumes.

References

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

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

  3. Kevin Black, Noah Brown, Danny Driess, Adnan Esmail, Michael Equi, Chelsea Finn, Niccolo Fusai, Lachy Groom, and 16 more, RSS 2025, 2024.

    https://arxiv.org/abs/2410.24164

  4. Bo Ai, Ali Amin, Raichelle Aniceto, Ashwin Balakrishna, Greg Balke, Kevin Black, George Bokinsky, Shihao Cao, and 79 more, 2026.

    https://www.pi.website/download/pi07.pdf

  5. NVIDIA, Johan Bjorck, Fernando Castañeda, Nikita Cherniadev, Xingye Da, Runyu Ding, Linxi "Jim" Fan, Yu Fang, and 34 more, 2025.

    https://arxiv.org/abs/2503.14734

  6. Mahmoud Assran, Adrien Bardes, David Fan, Quentin Garrido, Russell Howes, Mojtaba Komeili, Matthew Muckley, Ammar Rizvi, and 21 more, 2025.

    https://arxiv.org/abs/2506.09985

  7. NVIDIA, Aditi, Niket Agarwal, Arslan Ali, Jon Allen, Martin Antolini, Adeline Aubame, Alisson Azzolini, and 287 more, 2026.

    https://research.nvidia.com/labs/cosmos-lab/cosmos3/technical-report.pdf

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

    https://arxiv.org/abs/2505.23705

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