Robot Wiki

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.

Last reviewed
Reading time
6 min
Citations
8

Machine learning gives you optimization, representation learning, sequence models and experimental discipline. It does not give you coordinate frames, control loops, contact dynamics or a reliable definition of task success. A useful robot-learning roadmap therefore starts at the interfaces where a model meets a machine. The aim is not to learn all of robotics before training a policy. It is to learn each dependency just before an experiment needs it.

The shortest route has six layers: geometry, data, imitation, action representation, evaluation and deployment. Foundation models and reinforcement learning sit on top of those layers; they do not remove them.

Try the check below and choose the baseline you would run before a larger policy. The option names the first experiment that separates a data problem from a model problem.

Self-check

You have 200 clean demonstrations for one tabletop task and no trusted success detector. What should you build first?
Read the reasoning
  • Start with a behavior-cloning baseline and a manual evaluation protocolThis is the useful first experiment. It checks whether observations align with actions, whether the action space is learnable, and whether success can be measured before architecture becomes another variable.
  • Fine-tune the largest available VLA immediatelyA larger pretrained model can add semantic priors, but it cannot tell you whether the demonstrations, action convention, reset procedure or evaluation labels are coherent. Starting here leaves every failure ambiguous.
  • Run online reinforcement learning on the real armWithout a reward and a safe reset loop, online RL has neither a trustworthy objective nor a practical data-collection process. The missing evaluation system is the immediate blocker.

Earn complexity: first prove that the data, action convention and success measurement support a small closed-loop policy.

Stage 1: make coordinates concrete

Start with kinematics, not because every learner will implement an inverse-kinematics solver, but because observations and actions live in frames. You should be able to answer four questions without looking at the training code: which frame an object pose uses, which frame an end-effector delta uses, whether rotations compose on the left or right, and where joint limits enter. Modern Robotics supplies the compact mathematical vocabulary for this layer Lynch 2017.

Then read calibration and state estimation. A policy can appear stochastic when the real defect is a drifting camera transform or a timestamp mismatch. This is the first habit to import from robotics: before changing the network, prove that the target the network sees refers to the same physical state as the action in the label.

Stage 2: treat data collection as a system

Robot data is a coupled record, not a folder of images. Each transition needs synchronized observations, the commanded action, the action actually realized when available, robot state, task identity, termination, and enough provenance to reproduce the split. DROID shows what consistency buys: a shared hardware and collection protocol across institutions made its 76,000 trajectories more comparable than a much looser federation Khazatsky 2024.

Before collecting at scale, record ten episodes and replay them end to end. Plot timestamp gaps. Render actions back onto the robot state. Verify units and rotation conventions. Check that train and test environments do not share nearly identical episodes. These checks are cheaper than discovering after a week of teleoperation that camera and joint streams were offset by two frames.

The datasets guide explains the public corpora; the robot-learning stack explains the machinery around your own.

Stage 3: establish the imitation baseline

Behavior cloning is supervised learning with a closed-loop distribution shift. The learner sees expert states during training and its own imperfect states at deployment. DAgger formalized why errors compound and why collecting corrective actions on learner-induced states changes the problem Ross 2011.

Run the smallest baseline that can close the loop. For image observations, that might be an encoder plus an MLP or a short transformer. Keep one camera, one task and one action convention. If it fails, inspect data alignment, normalization, reset diversity and label multimodality before adding scale.

Once the baseline is legible, add temporal structure. ACT predicts chunks of future actions and uses temporal ensembling at execution, reducing the number of decisions that can drift Zhao 2023. Diffusion Policy represents a multimodal distribution over action sequences and executes it in a receding horizon Chi 2023. These are not interchangeable upgrades: chunking addresses temporal dependence, while diffusion addresses a distribution with several plausible modes.

Stage 4: choose the action contract

Read action spaces before comparing policy architectures. Joint positions are easy to replay but embodiment-specific. End-effector deltas transfer task geometry but require a controller and a frame convention. Torques expose contact authority and inherit the dynamics, rate and safety burden of the low-level loop. Discrete tokens fit language-model training machinery and add quantization and decoding cost.

The action representation is part of the dataset. Changing it changes the labels, the controller under the policy, the error modes and often the set of robots that can share data. No model comparison is clean if those changed at the same time.

Stage 5: add pretraining only after the interfaces hold

A VLA is useful when task language, semantic generalization or multi-task transfer matters. OpenVLA made the recipe reproducible: fuse spatial and semantic vision features into a language backbone, then fine-tune it to emit robot actions Kim 2024. The starting checkpoint is valuable, but the same data alignment and action-space constraints remain.

Ask what pretraining is supposed to provide. If the missing capability is recognizing an unseen object category, web-scale vision-language pretraining is a plausible intervention. If the failure is a gripper colliding because the hand-eye transform is wrong, it is not. The foundation-model guide separates transfer claims from architecture labels.

Stage 6: make evaluation harder than the demo

Create the evaluation protocol before the main training run. Define task success, failure, intervention, reset and timeout. Separate familiar configurations from changed objects, backgrounds, lighting and geometry. Report trial counts and uncertainty, not only an average. LIBERO-Plus demonstrated how policies that look saturated on standard suites can fail under controlled visual and physical perturbations Fei 2025.

Open-loop loss is a diagnostic, not the result. A useful evaluation pyramid has four levels:

  1. Dataset checks: leakage, action distributions, timestamps and annotation quality.
  2. Open-loop checks: prediction error and calibration on held-out episodes.
  3. Closed-loop checks: success, interventions and failure modes under controlled shifts.
  4. Deployment checks: cycle time, recovery, resets, hardware faults and operator load.

When simulation and RL enter

Simulation belongs where it answers a concrete question: whether a controller is stable, whether a policy survives parameter variation, or whether a reward can be optimized safely. Isaac Lab is designed for large-scale, multi-modal robot-learning workflows and is an appropriate environment once the task's contact and sensor assumptions are credible NVIDIA 2025. It is not a substitute for measuring the gap between its dynamics and the hardware.

Offline RL belongs when a logged dataset contains meaningful variation in outcome quality and a reward can rank that variation. Online RL belongs when the system can explore safely, reset automatically and evaluate cheaply. Until those conditions hold, imitation learning is usually the stronger use of the same robot hours.

A practical sequence

For a first serious project, spend the opening phase on replayable data and a deterministic evaluation harness. Build behavior cloning next. Add action chunks or a multimodal head only when the baseline exposes the need. Add a VLA when semantic transfer is part of the task. Add RL only when the reward, coverage and reset loop are real.

The sequence is conservative because robot experiments are expensive and confounded. Its benefit is speed: every stage produces an artifact you keep, and every added method answers a failure you can already name.

See also

  • The Robot Learning Stack

    Data capture, schemas, training, simulation, evaluation, serving and robot integration as one reproducible system rather than a model checkpoint.

  • Action Spaces for Robot Learning

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

  • Major Datasets

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

  • The Evaluation Crisis

    Why N-of-10 trials and unreported variance mislead: 95% per-step success is unusable at 30 steps.

Linked from

  • Major Datasets

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

  • The Robot Learning Stack

    Data capture, schemas, training, simulation, evaluation, serving and robot integration as one reproducible system rather than a model checkpoint.

References

  1. Kevin M. Lynch, Frank C. Park, Cambridge University Press, 2017.

    https://modernrobotics.northwestern.edu/

  2. Stéphane Ross, Geoffrey J. Gordon, J. Andrew Bagnell, AISTATS 2011.

    https://arxiv.org/abs/1011.0686

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

    https://arxiv.org/abs/2304.13705

  4. Cheng Chi, Zhenjia Xu, Siyuan Feng, Eric Cousineau, Yilun Du, Benjamin Burchfiel, Russ Tedrake, Shuran Song, 2023.

    https://arxiv.org/abs/2303.04137

  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. Alexander Khazatsky, Karl Pertsch, Suraj Nair, 2024.

    https://arxiv.org/abs/2403.12945

  7. NVIDIA, Mayank Mittal, Yunrong Guo, Pascal Roth, David Hoeller, James Tigue, Antoine Richard, Octi Zhang, and 98 more, 2025.

    https://arxiv.org/abs/2511.04831

  8. Senyu Fei, Siyin Wang, Junhao Shi, Zihao Dai, Jikun Cai, Pengfang Qian, Li Ji, Xinzhe He, and 5 more, 2025.

    https://arxiv.org/abs/2510.13626

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