This is not a course list. This is a life plan for mastering the deepest field humanity has ever built.
Most people who study AI learn what things are.
World-class researchers understand why they are, when they break, and what comes next.
The gap between "knowing about AI" and "knowing AI" is not more courses.
It is the quality and depth of your thinking.
"You don't understand something until you can derive it yourself, break it yourself, and fix it yourself."
Level 1 ā LITERATE You can read about AI and understand it
Level 2 ā PRACTITIONER You can build AI systems that work
Level 3 ā RESEARCHER You can find and solve problems others don't see
Level 4 ā FRONTIER You define what the field studies next
Most people stop at Level 2. This roadmap takes you to Level 4.
Self-Assessment Checklist:
- [ ] Can I prove backpropagation from scratch?
- [ ] Can I derive gradient descent from a Taylor expansion?
- [ ] Can I explain why attention is O(n²) and what flash attention changes?
- [ ] Can I state the PAC learning theorem and what it implies?
- [ ] Can I explain the difference between KL divergence and Wasserstein distance?
- [ ] Can I derive the ELBO for a VAE from Bayes' theorem?
- [ ] Can I explain what an induction head is in a transformer?
- [ ] Can I write a transformer from scratch in NumPy?
Rule: For every "No" ā that gap is your first priority.
| Topic | Resource | Output |
|---|---|---|
| SVD, eigendecomposition, matrix calculus | Gilbert Strang (MIT OCW) | Derive PCA from scratch |
| Multivariable calculus, Jacobians, Hessians | 3Blue1Brown (Essence of Calculus) + Stewart | Derive Newton's method |
| Automatic differentiation | Baydin et al. (2018) | Build autograd in Python |
| Topic | Resource | Output |
|---|---|---|
| Measure theory basics | Durrett "Probability" Ch 1ā3 | Prove SLLN |
| Bayesian inference | MacKay Ch 2ā4 | Implement MCMC sampler |
| Information Theory | Cover & Thomas Ch 1ā5 | Prove data processing inequality |
| Concentration inequalities | Wainwright "High-Dim Stats" | Derive Hoeffding's bound |
| Topic | Resource | Output |
|---|---|---|
| Convex analysis | Boyd & Vandenberghe (free PDF) | Solve QP with KKT conditions |
| Non-convex landscapes | Dauphin et al. 2014 | Explain why saddle points ā local minima |
| SGD convergence theory | Bottou et al. 2018 | Derive convergence rate |
| NTK Theory | Jacot et al. 2018 | Explain infinite-width limit |
| Topic | Resource | Output |
|---|---|---|
| VC Theory | Shalev-Shwartz "Understanding ML" | Prove VC shattering |
| Rademacher Complexity | Bartlett & Mendelson 2002 | Derive generalization bounds |
| PAC-Bayes | McAllester 1999 | Implement a PAC-Bayes bound |
| Double Descent | Belkin et al. 2019 | Reproduce the experiment |
Mastery Test: Take any top NeurIPS paper from 2020ā2024. If you can follow every derivation ā you pass.
Mastery Test: Reproduce any architecture from a landmark paper using only the paper. No tutorial, no existing code. It must converge.
Mastery Test: Full RLHF training loop from scratch. It must converge.
Pick 2ā3 and go deeper than anyone else:
| Frontier Area | Key Papers | What You'll Build |
|---|---|---|
| Geometric Deep Learning | Bronstein 2021 | Equivariant protein model |
| Causal AI | Pearl, IRM paper | Causal discovery algorithm |
| World Models | LeCun JEPA, DreamerV3 | Latent dynamics model |
| Physical AI / Robotics | RT-2, Ļ0 | Imitation learning pipeline |
| Scientific AI | AlphaFold 2, ESM3 | Sequence model |
| AI for Math | AlphaProof, Lean4 | Formal proof assistant |
| AI Agents | ReAct, Voyager | Tool-using agent system |
07:00 ā Read 1 paper from arxiv (cs.LG, cs.AI, stat.ML)
07:45 ā Write 3 bullets: main contribution, key assumption, one weakness
08:00 ā Implement or derive one thing from yesterday's paper
21:00 ā Deep work: derive, implement, or write about one concept
22:00 ā Update your Known Unknown Map
22:30 ā Queue tomorrow's paper
1. Study a concept until you think you understand it
2. Close every resource
3. Explain it as if teaching a smart 15-year-old
4. Find every "kind of" or "sort of" ā those are your gaps
5. Go back and fill them
6. Repeat until zero vague words remain
Create known_unknown_map.md and update it weekly:
## I Know Deeply (Can Derive + Implement + Explain)
- Backpropagation
- Attention mechanism
## I Know Superficially (Can Explain but Not Derive)
- NTK theory
- Wasserstein GAN
## I Know Exist But Don't Understand
- Free Energy Principle
- Kolmogorov complexity
## I Don't Know I Don't Know
(Filled by reading broadly ā these surprises are the most valuable)
This map is your real measure of progress ā not certifications or courses completed.
| Book | Why |
|---|---|
| Understanding Machine Learning ā Shalev-Shwartz | Best theoretical ML text |
| Deep Learning ā Goodfellow, Bengio, Courville | Architecture theory bible |
| Reinforcement Learning ā Sutton & Barto | Complete RL foundation |
| Information Theory, Inference & Learning ā MacKay | Unified information view |
| The Book of Why ā Pearl | Causal thinking |
| Human Compatible ā Stuart Russell | Alignment from first principles |
| Source | What You Get |
|---|---|
| arxiv.org/list/cs.LG/recent | Daily frontier papers |
| Papers With Code | Benchmarks, implementations |
| Distill.pub | Clearest explanations in ML |
| Anthropic Research Blog | Interpretability frontier |
| Alignment Forum | AI safety research discourse |
ml-from-scratch/
āāā foundations/
ā āāā autograd_engine.py # Your own autograd
ā āāā optimization/ # SGD, Adam, natural gradient
āāā architectures/
ā āāā transformer_numpy.py # Full transformer, no PyTorch
ā āāā diffusion_ddpm.py # DDPM from scratch
ā āāā gnn_basic.py # Message passing GNN
āāā learning_paradigms/
ā āāā ppo_from_scratch.py # PPO implementation
ā āāā meta_maml.py # MAML
āāā theory/
āāā generalization_bounds.py # PAC, VC, Rademacher
This repository is your proof of knowledge ā better than any degree.
| Level | Test |
|---|---|
| Level 1 | Read any NeurIPS abstract and explain the contribution plainly |
| Level 2 | Implement a transformer from scratch in < 200 lines |
| Level 3 | Read 10 papers in one area; identify the 3 most important open problems |
| Level 4 | Propose a novel research direction: formal problem statement + hypothesis + experimental protocol + expected theoretical contribution |
For every idea: What problem does this solve? What assumptions? What breaks? What's better?
Always ask: "Where have I seen this structure before?"
What experiment would prove this wrong? Has it been run? Why not?
| Day | Task |
|---|---|
| 1ā3 | Take the self-assessment. List every gap. |
| 4ā7 | Implement backpropagation from scratch in NumPy. No tutorials. |
| 8ā14 | Derive and implement the attention mechanism from scratch. |
| 15ā20 | Read "Attention Is All You Need" ā annotate every equation. |
| 21ā25 | Build your Known Unknown Map. Be brutally honest. |
| 26ā30 | Implement DDPM from the paper alone. |
After 30 days, you will know more about AI than 95% of ML engineers.
After 24 months, you will be at the frontier.
There is no certification for knowing everything about AI.
There is no moment where you "arrive."
The person who knows the most about AI is the person who:
The goal is not to finish this roadmap.
The goal is to become the kind of person who never stops.
"The master has failed more times than the beginner has tried."
This is a living document. Update it as you learn. The version of you at Month 24 will find things in Month 1 that need correcting ā that's how you know it's working.