Sources & summaries
Every link you've added, what it became, the primary sources followed through to, the files saved locally, and every external reference each module cites.
- Module 01: LLM evals with decision models: thresholds, trade-offs and calibration
- Module 02: TensorTonic: hands-on ML practice for LLMs and robotics
- Module 03: How much to help: human–AI and human–robot interaction
- Module 04: Big teacher, small student: distilling fast on-device models for apps and robots
- Module 05: LLM architecture at trillion scale: width, depth and length in Kimi K3
- Module 06: Ilya's 30 papers: the shared foundations of LLMs and robotics
- Module 07: LLM post-training: demonstrations, comparisons and checkers (and the robot equivalents)
- Module 08: The LLM research-engineer roadmap: 12 stages, from autograd to open-source teardowns
- Module 09: LLM inference engineering: 25 interview problems, worked through with real numbers
- Module 10: Self-improving agent harnesses: Recursive Language Models, Continual Harness and Prime Agent
- Module 11: The LLM self-study stack: CS336, Build a Reasoning Model, the RLHF Book (and a gym plan)
- Module 12: AI training and inference, in nine videos: watch guides for Jia-Bin Huang's playlist
- Module 13: 100 days of inference engineering: a learning journal, the book behind it, and a plan you can follow
- Module 14: Deep-ML's Deep-Path: 103 concepts from classical ML to GPU kernels, mapped onto this course (with a placement check)
- Module 15: Inference Engineering, interactive edition: how to use inferenceengineering.tech alongside this course
- Module 16: Hands-On LLM Serving and Optimization: the book's code as a lab track
- Module 17: 391 free AI courses, checked: a searchable catalog with link health, provenance, and 2026 updates
- Module 18: Build a Robot Brain: 12 weeks, from zero to a robot that understands you (ages 15+)
- Module 19: Evals: how to know whether an AI system actually works (a field guide, from one test case to a release gate)
- Module 20: Six tiny repos that rebuild modern AI from scratch: micrograd, minGPT, nanoGPT, llm.c, tinygrad, minimalRL (run and tested)
- Module 21: The maths behind robots, learned by playing: ten interactive explainers, each one used to make Robo-Helper better
- Module 22: Gradient, divergence and curl: three ways a field of arrows moves, and how a robot steers with them
LLM evals with decision models: thresholds, trade-offs and calibration
Summary: Set minimum precision and recall first, tune the threshold with CV, verify calibration, then pick on the cost/quality frontier.
Followed through to:
All 7 external references cited in this module
| Reference | Site |
|---|---|
| full post with interactive charts | hamel.dev |
| Hamel: Creating an LLM judge that drives business results | hamel.dev |
| Why binary pass/fail instead of 1–5 scales | hamel.dev |
| scikit-learn: precision, recall, F-measure | scikit-learn.org |
| Machine Learning with Python Cookbook , 2nd ed. | oreilly.com |
| Randy Olson: When to use a decision model instead of an LLM | randalolson.com |
| X post | x.com |
TensorTonic: hands-on ML practice for LLMs and robotics
Summary: Drill the maths and learning half of robotics from scratch: transforms, CV, the RL ladder to PPO, ViT/DDPM. Kinematics, control, estimation and planning need other sources.
Followed through to:
All 53 external references cited in this module
| Reference | Site |
|---|---|
| tensortonic.com | tensortonic.com |
| dot product & norms | tensortonic.com |
| matrix multiplication | tensortonic.com |
| orthogonality | tensortonic.com |
| least squares | tensortonic.com |
| SVD | tensortonic.com |
| eigenvalues | tensortonic.com |
| Bayes | tensortonic.com |
| covariance matrices | tensortonic.com |
| Markov chains | tensortonic.com |
| Monte Carlo | tensortonic.com |
| Jacobians & Hessians | tensortonic.com |
| matrix transpose | tensortonic.com |
| Apply 4×4 homogeneous transform | tensortonic.com |
| Gaussian blur | tensortonic.com |
| Sobel edges | tensortonic.com |
| bilinear resize | tensortonic.com |
| image rotation | tensortonic.com |
| IoU | tensortonic.com |
| non-max suppression | tensortonic.com |
| anchor generation | tensortonic.com |
| Hungarian matching | tensortonic.com |
| mIoU | tensortonic.com |
| Dice loss | tensortonic.com |
| Cracking CV | tensortonic.com |
| Transformers, ViT, U-Net, DDPM | tensortonic.com |
| patchify | tensortonic.com |
| ViT attention block | tensortonic.com |
| CLIP retrieval | tensortonic.com |
| quantization | tensortonic.com |
| KV cache | tensortonic.com |
| discounted returns | tensortonic.com |
| Bellman expectation | tensortonic.com |
| Bellman optimality | tensortonic.com |
| value iteration | tensortonic.com |
| policy iteration | tensortonic.com |
| Monte Carlo evaluation | tensortonic.com |
| TD(0) | tensortonic.com |
| SARSA | tensortonic.com |
| Q-learning | tensortonic.com |
| ε-greedy | tensortonic.com |
| UCB1 | tensortonic.com |
| Thompson sampling | tensortonic.com |
| replay buffer | tensortonic.com |
| DQN with target net | tensortonic.com |
| Double DQN | tensortonic.com |
| REINFORCE | tensortonic.com |
| with baseline | tensortonic.com |
| A2C | tensortonic.com |
| GAE | tensortonic.com |
| PPO clipped objective | tensortonic.com |
| ML Math | tensortonic.com |
| All problems | tensortonic.com |
How much to help: human–AI and human–robot interaction
Summary: Blend robot and human control by calibrated confidence, keep intent beliefs revisable, choose ask/act/wait by expected cost, and keep the struggle where the learning is.
Followed through to:
Big teacher, small student: distilling fast on-device models for apps and robots
Summary: Log a big model on your narrow task, fine-tune the smallest model that meets your bar, evaluate against hand-corrected data split by day, and measure latency on the target device. Milliseconds are metres.
Followed through to:
All 6 external references cited in this module
| Reference | Site |
|---|---|
| own-voice-stt repo | github.com |
| evaluation doc | github.com |
| pitfalls | github.com |
| tiny-classifiers | github.com |
| maivi | github.com |
| X post | x.com |
LLM architecture at trillion scale: width, depth and length in Kimi K3
Summary: Read architectures along three axes: width (sparse experts, balanced routing), depth (layers that reach back), length (fixed-size memory plus some global attention). Every feature also needs a numerical-stability fix and a serving plan.
Followed through to:
All 8 external references cited in this module
| Reference | Site |
|---|---|
| Kimi K3 repo and technical report | github.com |
| Baseten model page | baseten.co |
| mixture-of-experts | tensortonic.com |
| KV cache | tensortonic.com |
| speculative decoding | tensortonic.com |
| quantisation | tensortonic.com |
| @antiAIvo's post | x.com |
| Philip Kiely (Baseten) | x.com |
Ilya's 30 papers: the shared foundations of LLMs and robotics
Summary: The toolbox behind robot learning in 30 days: memory (RNN → LSTM → attention), seeing (AlexNet → ResNet), relations and graphs, compression as learning, scale, and learning to act (PPO, RLHF). Start each day with the plain-language box.
Followed through to:
All 71 external references cited in this module
LLM post-training: demonstrations, comparisons and checkers (and the robot equivalents)
Summary: Pre-training sets what a model knows; post-training sets how it uses it. Three teachers: demonstrations (SFT / behaviour cloning), comparisons (RLHF, DPO), checkers (RLVR / success detectors). Always keep a leash and watch the true metric.
All 1 external references cited in this module
| Reference | Site |
|---|---|
| post | x.com |
The LLM research-engineer roadmap: 12 stages, from autograd to open-source teardowns
Summary: Twelve skills that turn papers into fast, well-tested models. Learn the internals, the data, the architectures, alignment, systems and inference, then reproduce and publish honestly. Most stages tie back to modules 01–07.
Followed through to:
All 152 external references cited in this module
LLM inference engineering: 25 interview problems, worked through with real numbers
Summary: Serving is arithmetic plus trade-offs: size the KV cache, keep the GPU busy with continuous batching, protect TTFT with chunked prefill, reuse prefixes, pick precision and GPUs by bandwidth, measure tails, and price it all from explicit assumptions.
Followed through to:
All 81 external references cited in this module
Self-improving agent harnesses: Recursive Language Models, Continual Harness and Prime Agent
Summary: Don't stuff the context: keep it in variables and query it with code and sub-calls (RLM). Let the agent refine its own harness in small, reversible steps without resets (Continual Harness). Read harness benchmarks as "model + harness".
Followed through to:
- Prime Agent paper (arXiv 2608.23552)
- Prime Agent repo
- Prime Agent launch post
- Recursive Language Models (arXiv 2512.24601)
- Continual Harness (arXiv 2605.09998)
- The video
All 14 external references cited in this module
| Reference | Site |
|---|---|
| original blog post | alexzhang13.github.io |
| Prime Agent: A Self-Improving RLM Harness | arxiv.org |
| Recursive Language Models | arxiv.org |
| Continual Harness: Online Adaptation for Self-Improving Foundation Agents | arxiv.org |
| repo | github.com |
| rlm-minimal | github.com |
| library | github.com |
| verifiers | github.com |
| prime-rl | github.com |
| project page | sethkarten.ai |
| launch post | primeintellect.ai |
| Recursive Language Models: the paradigm of 2026 | primeintellect.ai |
| “Prime Agent: Self-Improving RLM Harness” | youtube.com |
| X post | x.com |
The LLM self-study stack: CS336, Build a Reasoning Model, the RLHF Book (and a gym plan)
Summary: Build it to understand it: CS336 (pre-training and systems) → Raschka (reasoning, GRPO, distillation) → Lambert (post-training). Plan the hours honestly, and keep your body in the plan.
Followed through to:
- Stanford CS336
- Build a Reasoning Model (From Scratch): code
- RLHF Book
- 凯圣王 × 谭成义 three-way split (Bilibili)
All 6 external references cited in this module
| Reference | Site |
|---|---|
| Build a Reasoning Model (From Scratch): code repository | github.com |
| Raschka's free video course | magazine.sebastianraschka.com |
| RLHF Book | rlhfbook.com |
| Stanford CS336, Spring 2025 | stanford-cs336.github.io |
| video collection on Bilibili | bilibili.com |
| X post | x.com |
AI training and inference, in nine videos: watch guides for Jia-Bin Huang's playlist
Summary: Watch the mechanisms move: memory and parallelism, LoRA, GRPO, on-policy distillation, optimisers, speculative decoding and serving, each guide tied back to the course's deeper pages.
Followed through to:
All 205 external references cited in this module
100 days of inference engineering: a learning journal, the book behind it, and a plan you can follow
Summary: One chapter of Kiely's book per block, one build per chapter, one written note per day, shared publicly. Start with the smallest model that passes your evals.
Followed through to:
All 2 external references cited in this module
| Reference | Site |
|---|---|
| 100-days-of-inference-engineering | github.com |
| Inference Engineering | baseten.co |
Deep-ML's Deep-Path: 103 concepts from classical ML to GPU kernels, mapped onto this course (with a placement check)
Summary: Find your frontier, then drill a few steps a day with spaced review. Read the course page to understand a concept, and do the Deep-Path problems to make it stick. Robotics and control is the thinnest part of the map.
Followed through to:
All 2 external references cited in this module
| Reference | Site |
|---|---|
| Deep-ML Deep-Path placement test | deep-ml.com |
| Deep-Path map | deep-ml.com |
Inference Engineering, interactive edition: how to use inferenceengineering.tech alongside this course
Summary: Read the book chapter, run its calculator, then cross-check against the course's own demo and explain any gap. Treat single-setup benchmarks as a starting point.
Followed through to:
All 9 external references cited in this module
| Reference | Site |
|---|---|
| inferenceengineering.tech | inferenceengineering.tech |
| chapters | inferenceengineering.tech |
| paths | inferenceengineering.tech |
| calculators | inferenceengineering.tech |
| cheat sheets | inferenceengineering.tech |
| glossary | inferenceengineering.tech |
| benchmarks | inferenceengineering.tech |
| about | inferenceengineering.tech |
| Baseten's official book page | baseten.co |
Hands-On LLM Serving and Optimization: the book's code as a lab track
Summary: Build a small server yourself (API, scheduler, worker process), then swap in real engines and optimise one change at a time on realistic data. Batching trades latency for throughput, and continuous batching mostly removes that trade.
Followed through to:
All 6 external references cited in this module
| Reference | Site |
|---|---|
| vLLM docs | docs.vllm.ai |
| orca3/llm-model-inference | github.com |
| llama.cpp | github.com |
| LMCache | github.com |
| book website | orca3.github.io |
| O'Reilly page | oreilly.com |
391 free AI courses, checked: a searchable catalog with link health, provenance, and 2026 updates
Summary: A huge free list is only useful once it's filtered and verified. Keep the classics for foundations, add post-2022 courses for LLMs and robotics, and prefer courses with assignments over lectures alone.
Followed through to:
All 23 external references cited in this module
| Reference | Site |
|---|---|
| fast.ai | course.fast.ai |
| Stanford CS224W | cs224w.stanford.edu |
| Stanford CS231n notes | cs231n.github.io |
| kmario23/deep-learning-drizzle | github.com |
| LeRobot | github.com |
| MIT 6.5940 TinyML & Efficient DL | hanlab.mit.edu |
| Hugging Face LLM Course | huggingface.co |
| Hugging Face Deep RL Course | huggingface.co |
| Hugging Face Robotics Course | huggingface.co |
| Isaac Lab | isaac-sim.github.io |
| Karpathy, Zero to Hero | karpathy.ai |
| MIT Robotic Manipulation | manipulation.csail.mit.edu |
| Modern Robotics | modernrobotics.northwestern.edu |
| MuJoCo | mujoco.org |
| Berkeley CS 185/285 Deep RL | rail.eecs.berkeley.edu |
| RLHF Book | rlhfbook.com |
| Stanford CS336 | stanford-cs336.github.io |
| MIT Underactuated Robotics | underactuated.mit.edu |
| Stanford CS224n | web.stanford.edu |
| Coursera specialisation | coursera.org |
| CMU 16-385 | cs.cmu.edu |
| DeepLearning.AI, Post-training of LLMs | deeplearning.ai |
| X article | x.com |
Build a Robot Brain: 12 weeks, from zero to a robot that understands you (ages 15+)
Summary: Learn by building: each idea from first principles, then real code, a self-check and a real-world challenge, growing into one working robot that's honestly tested. Then inference engineering: a tiny LM from zero, latency and cost, caching/quantising/distilling, Claude as planner and agent, and a bake-off of every brain.
Followed through to:
All 2 external references cited in this module
| Reference | Site |
|---|---|
| LeRobot | github.com |
| robotics course | huggingface.co |
Evals: how to know whether an AI system actually works (a field guide, from one test case to a release gate)
Summary: An eval is input, system, grader, number. Read outputs before writing graders, use code for anything definite, and trust an AI judge only after measuring it (kappa, not raw agreement), with the evidence in front of it. Every score gets an error bar; agents get pass^k.
Followed through to:
All 8 external references cited in this module
| Reference | Site |
|---|---|
| Adding Error Bars to Evals | arxiv.org |
| Who Validates the Validators? | arxiv.org |
| Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena | arxiv.org |
| τ-bench | arxiv.org |
| RAGAS | arxiv.org |
| Your AI Product Needs Evals | hamel.dev |
| AI Evals FAQ | hamel.dev |
| X article | x.com |
Six tiny repos that rebuild modern AI from scratch: micrograd, minGPT, nanoGPT, llm.c, tinygrad, minimalRL (run and tested)
Summary: Read tiny code that does the real thing, run it, then use it to try to make your own robot better, and measure whether it did. Bigger models need more data; a fast brain on a laptop can be too slow on a robot; learned control is great until the world changes.
Followed through to:
All 34 external references cited in this module
The maths behind robots, learned by playing: ten interactive explainers, each one used to make Robo-Helper better
Summary: Play with each idea first, then use it on your own robot and measure it. Estimation (Bayes, Kalman, Fourier) beats plain averaging once the robot moves; a model of the world only helps if the world has patterns; π0 and GR00T are a scene-understanding Transformer plus a noise-to-motion head.
Followed through to:
- His guide: How π0, GR00T and Optimus actually think (X article)
- Immersive Linear Algebra
- Seeing Theory
- Markov chains (Setosa)
- Kalman filter in pictures
- A* (Red Blob Games)
- Fourier (Jez Swanson)
- Why Momentum Really Works (Distill)
- REINFORCEjs
- Transformer Explainer
- Diffusion Explainer
- openpi
- Isaac-GR00T
All 17 external references cited in this module
| Reference | Site |
|---|---|
| Andrej Karpathy: REINFORCEjs | cs.stanford.edu |
| Gabriel Goh: Why Momentum Really Works (Distill) | distill.pub |
| openpi | github.com |
| Isaac-GR00T | github.com |
| LeRobot | github.com |
| Immersive Math: “Immersive Linear Algebra” | immersivemath.com |
| Polo Club (Georgia Tech): Transformer Explainer | poloclub.github.io |
| Polo Club: Diffusion Explainer | poloclub.github.io |
| Seeing Theory (Brown University) | seeing-theory.brown.edu |
| Setosa: Markov chains, explained visually | setosa.io |
| Tim Babb: How a Kalman filter works, in pictures | bzarg.com |
| Jez Swanson: An Interactive Introduction to Fourier Transforms | jezzamon.com |
| A* page | redblobgames.com |
| Stanford AA203 lecture 15 | youtube.com |
| Berkeley CS 285 lecture 2 | youtube.com |
| X post | x.com |
| “How π0, GR00T and Optimus actually think” | x.com |
Gradient, divergence and curl: three ways a field of arrows moves, and how a robot steers with them
Summary: Gradient = uphill, divergence = spreading out or draining in, curl = swirl. A robot can drive by following a field, but pure gradients get stuck in dips; a little curl around obstacles gets it round. Measure from many starts, not one.
Followed through to:
All 3 external references cited in this module
| Reference | Site |
|---|---|
| Multivariable calculus | khanacademy.org |
| Divergence and curl: the language of Maxwell's equations, fluid flow, and more | youtube.com |
| X post | x.com |