Build robots that see, think & move.

Eight free courses, from first-principles math to deployed autonomy — every lesson a hands-on build with runnable Python, not a slide deck.

Start the guided path →

08 courses · 119 lessons · in-browser python, no install · free, no account

Guided Foundations Path

Start here, in order

A beginner on-ramp through the catalog: 16 ordered steps that build on each other, each naming what it needs and what you will be able to do after. Follow the highlighted step, or scan the whole path before you start.

6-7.5 hours of learner time16 published, 0 forthcomingprogress saved in this browser
Next step
Step 01 · Start Here: Python and the Math the Labs Use
35-45 min · Linear Algebra
Start step
0 of 16 published steps done00%
  1. Start Here: Python and the Math the Labs Use35-45 min

    Run a browser cell; use variables, lists, loops, functions and numpy arrays; read sums, averages, area under a curve and slope.

    Prereq · Entry point · Linear AlgebraNext up
  2. Probability Spaces and Events15-20 min

    Define a sample space, an event and a probability measure from the axioms, and compute probabilities on finite spaces.

    Prereq · Step 01 · Prob & StatsAvailable
  3. Random Variables and Distributions15-20 min

    Describe a random variable with a PMF, PDF or CDF, and recognise the Bernoulli, binomial, uniform and exponential distributions.

    Prereq · Step 02 · Prob & StatsAvailable
  4. Expectation, Variance, and Covariance15-20 min

    Compute expectation, variance and covariance, and use linearity of expectation without assuming independence.

    Prereq · Steps 02-03 · Prob & StatsAvailable
  5. Conditioning and Independence15-20 min

    Work with conditional probability, the chain rule, independence and conditional independence.

    Prereq · Steps 02-04 · Prob & StatsAvailable
  6. Bayes' Rule and Generative Classification15-20 min

    Apply Bayes' rule, connect prior, likelihood and posterior, and classify with a maximum-a-posteriori decision.

    Prereq · Steps 02-05 · Prob & StatsAvailable
  7. Laws of Large Numbers and the CLT20 min

    Explain the law of large numbers and the central limit theorem, and reason about sampling distributions.

    Prereq · Steps 03-04 · Prob & StatsAvailable
  8. Vectors and Linear Combinations25-30 min

    Use vectors in R^n, build linear combinations, and reason with the dot product and orthogonality.

    Prereq · Step 01 · Linear AlgebraAvailable
  9. Linear Transformations and Matrices25-30 min

    Recognise linear maps, compute matrix-vector products and compose transformations.

    Prereq · Step 08 · Linear AlgebraAvailable
  10. Optimization for Learning25-30 min

    Frame learning as empirical risk minimisation and follow a gradient-descent update from gradient to chain rule.

    Prereq · Step 01, Steps 08-09 · OptimizationAvailable
  11. Reinforcement Learning: Agents, Rewards, and MDPs20-25 min

    Describe the agent–environment loop, explain the reward hypothesis, and name the ingredients of a Markov decision process.

    Prereq · Steps 01-09 · Reinforcement LearningAvailable
  12. Returns, Value, and the Bellman Equation20-25 min

    Compute discounted returns, explain value functions, and use the Bellman equation to relate a state's value to its successors.

    Prereq · Step 11 · Reinforcement LearningAvailable
  13. Bandits: Exploration, Exploitation, and Regret20-25 min

    Explain the exploration/exploitation trade-off and measure a bandit algorithm by its regret.

    Prereq · Steps 02-06, Steps 11-12 · Reinforcement LearningAvailable
  14. Bandits: UCB1 and Thompson Sampling20-25 min

    Run and compare two principled bandit algorithms: UCB1 and Thompson sampling.

    Prereq · Step 13 · Reinforcement LearningAvailable
  15. Robotics Foundations: Sensors, Actions, and Motion35-45 min

    Explain the sense-decide-act loop, name a robot's joints, links and end effector, and predict how a joint angle moves the hand.

    Prereq · Steps 01-06, Steps 08-09 · Robot LearningAvailable
  16. Robots Under Uncertainty: Estimating Position from Noisy Sensors35-45 min

    Separate true state, prediction, measurement and estimate, and explain why combining a prediction with a measurement helps.

    Prereq · Steps 02-06, Step 15 · Robot LearningAvailable

All courses

In the recommended learning-path order — foundations first, then applied, then electives.

Linear AlgebraVectors, matrix factorizations, and eigendecomposition from first principles — the mathematical foundation every other course in this catalog assumes.Beginner14wOptimizationFirst-order methods and convex toolkit for training models — from gradient descent to Adam, with enough convexity to know what your optimizer can and cannot guarantee.Intermediate14wReinforcement LearningPolicy gradient, Q-learning, and actor-critic methods built from the Bellman equation up. Train agents in MuJoCo and Atari.Intermediate14wRobot LearningImitation learning, behaviour cloning, and sim-to-real transfer. Build controllers that learn from demonstration and adapt to reality.Intermediate14wPhysical AI & Vision-Language ModelsFrom vision backbones to embodied agents — how language and perception fuse into systems that act in the physical world.Advanced14wGenerative ModelsVAEs, diffusion models, and flow matching from first principles. Build systems that synthesize images, audio, and structured data.Advanced14wProbability & StatisticsProbability, conditioning, and estimation for machine learning — from random variables and Bayes to MLE/MAP, uncertainty, and the language of modern generative and RL models.Intermediate14wAdvanced OptimizationBoyd-depth duality and cone programs meet second-order, distributed, and sharpness-aware training — the bridge from convex structure to modern large-scale ML optimization.Advanced14w