The best resources for a time-poor senior engineer, newest first.
2026Book
Nathan Lambert · Sep 2026 · ~15 h
The best single text on post-training: instruction tuning, reward models, rejection sampling, PPO/GRPO, DPO-family methods, on-policy distillation, plus evaluation and over-optimization.
2026Course
Percy Liang, Tatsunori Hashimoto (Stanford) · Apr 2026 · ~70 h
The one course that walks the whole stack you'll be quizzed on: tokenizer, Transformer, GPU kernels, parallelism, scaling laws, data filtering, SFT and RL, each with a from-scratch assignment.
2025Book
Hugging Face (SmolLM team) · Oct 2025 · ~8 h
A frank, practitioner-level account of training SmolLM3: ablation design, architecture choices, data mixtures, infrastructure, failures and mid-run fixes, then post-training.
2025Practice
Andrej Karpathy · Oct 2025 · ~12 h
Single small codebase that trains tokenizer, pretrains, mid-trains, SFTs and RLs a chat model for about $100 on one 8×H100 node (speedrun.sh).
2025Blog post
Sebastian Raschka (Ahead of AI) · Jul 2025 · ~3 h
Side-by-side diagrams of DeepSeek-V3, OLMo 2, Gemma 3, Llama 4, Qwen3, Kimi K2, gpt-oss and others: MLA vs GQA, norm placement, QK-norm, MoE layout, sliding windows.
2025Paper
DeepSeek-AI · Jan 2025 · ~3 h
Shows pure RL with rule-based rewards produces long chain-of-thought (R1-Zero), then the multi-stage R1 recipe and distillation into small dense models.
2024Paper
DeepSeek-AI · Dec 2024 · ~6 h
MLA, fine-grained MoE with shared experts, auxiliary-loss-free load balancing, multi-token prediction, FP8 training and DualPipe, with costs.
2024Paper
Llama Team, AI @ Meta · Jul 2024 · ~8 h
The most complete public account of a frontier dense-model pipeline: data mix and annealing, scaling-law-chosen size, 4D parallelism, reliability at 16K GPUs, and iterated SFT + rejection sampling + DPO.
2024Paper
Zhihong Shao et al. (DeepSeek-AI) · Feb 2024 · ~2 h
Introduces GRPO (group-relative advantages, no value network) and a unified view of SFT, RFT, DPO, PPO and GRPO as gradient-coefficient choices.
2022Paper
Jordan Hoffmann et al. (DeepMind) · Mar 2022 · ~2 h
Three methods for fitting compute-optimal params vs tokens (~20 tokens/param) and the correction to Kaplan's scaling laws.