3Blue1Brown
Vectors | Chapter 1, Essence of linear algebra
Builds the picture you need for everything else: a vector as an arrow, as a list of numbers, and why both views matter.
Covers: Vectors, vector addition, scaling.
Lectures & explainers
Chapter 2
3Blue1Brown
Builds the picture you need for everything else: a vector as an arrow, as a list of numbers, and why both views matter.
Covers: Vectors, vector addition, scaling.
3Blue1Brown
The single best explanation of why a matrix is a transformation of space — which is exactly what a neural-network layer does.
Covers: Matrices as functions that move vectors; matrix–vector multiplication.
3Blue1Brown
Explains why the dot product measures alignment, connecting the arithmetic to the geometry.
Covers: Dot product, projection, the link between dot products and linear maps.
3Blue1Brown
Shows why multiplying matrices means applying one transformation after another — exactly what stacking neural-network layers does.
Covers: Matrix–matrix multiplication as composition of linear maps.
3Blue1Brown
The clearest visual intuition for eigenvectors: directions a transformation only stretches.
Covers: Eigenvectors, eigenvalues, why they matter for understanding a matrix.
3Blue1Brown
Turns Bayes from a formula into a picture of restricting your view to the evidence.
Covers: Prior, likelihood, posterior, and the area picture of Bayes theorem.
3Blue1Brown
Why a 90%-accurate test can still be wrong most of the time — base rates, made unforgettable.
Covers: Base rates, false positives, the odds form of Bayes rule.
3Blue1Brown
Rebuilds the idea of a derivative from scratch, visually, without assuming you remember school calculus.
Covers: What derivatives and integrals are really about.
3Blue1Brown
The chain rule is the engine of backpropagation; this makes it feel obvious rather than memorized.
Covers: Chain rule and product rule as nudges propagating through functions.
3Blue1Brown
Connects the abstract idea of minimizing a function to how a real network learns to recognise digits.
Covers: Cost functions, gradients in many dimensions, gradient descent.
StatQuest with Josh Starmer
Works gradient descent out by hand on a tiny regression problem, one step at a time.
Covers: Loss, derivatives, step size, stochastic gradient descent.
Aurélien Géron
Ten minutes that tie entropy, cross-entropy and KL divergence together — the three quantities behind language-model training.
Covers: Entropy as average surprise, cross-entropy as loss, KL as the gap between them.
3Blue1Brown
A playful but rigorous introduction to information and entropy as expected bits of surprise.
Covers: Information in bits, entropy, choosing actions that maximize expected information.
StatQuest with Josh Starmer
Short and concrete — what a confidence interval actually tells you, via bootstrapping.
Covers: Bootstrapping, confidence intervals.
Chapter 3
StatQuest with Josh Starmer
Seven minutes on the most important trade-off in machine learning.
Covers: Bias, variance, overfitting, underfitting.
StatQuest with Josh Starmer
Least squares, R², and what a fitted line actually tells you — from the ground up.
Covers: Fitting a line, residuals, R², p-values.
StatQuest with Josh Starmer
A short, clear picture of how logistic regression turns a line into probabilities.
Covers: The S-shaped curve, classification with probabilities, maximum likelihood.
StatQuest with Josh Starmer
How a tree chooses its questions — the most interpretable model in this chapter.
Covers: Splits, impurity (Gini), leaves, building a tree.
StatQuest with Josh Starmer
Why many random trees beat one careful tree.
Covers: Bootstrapping, random feature subsets, voting, out-of-bag error.
StatQuest with Josh Starmer
PCA built up geometrically, with no linear algebra assumed beyond the basics.
Covers: Principal components, variance explained, projection.
StatQuest with Josh Starmer
The k-means loop, animated.
Covers: Assign, update, repeat; choosing k.
StatQuest with Josh Starmer
How to evaluate a classifier across every possible threshold.
Covers: Confusion matrices, true/false positive rates, ROC curves, AUC.
StatQuest with Josh Starmer
Why you never test on your training data, and how to use limited data well.
Covers: Train/test splits, k-fold cross-validation.
StatQuest with Josh Starmer
Regularization made concrete: accept a little bias to reduce a lot of variance.
Covers: Ridge penalty, λ, bias–variance, fitting with few data points.
Chapter 4
Andrej Karpathy
Builds automatic differentiation from nothing; afterwards backpropagation stops feeling like magic.
Covers: Derivatives, the chain rule, computational graphs, backprop, a tiny neural network.
3Blue1Brown
The clearest visual introduction to what a neural network actually computes, layer by layer.
Covers: Neurons, weights, biases, layers, activations — all on digit recognition.
3Blue1Brown
Builds intuition for how each training example 'nudges' every weight — before any calculus.
Covers: What backpropagation does, and why stochastic gradient descent uses mini-batches.
3Blue1Brown
The chain rule applied to a network, step by step — the formal version of the previous video.
Covers: Derivatives through layers, the chain rule, sensitivity of the cost to each weight.
Chapter 6
Andrej Karpathy
Builds a character-level bigram model from counts, then trains a one-layer neural network that learns the same table by gradient descent.
Covers: Language modeling, count tables, smoothing, negative log-likelihood, and swapping counting for a trained network.
Andrej Karpathy
Implements the Bengio et al. 2003 neural language model at character level: an embedding lookup, a hidden layer and a softmax over the next character.
Covers: Learned embeddings, a fixed context window, training splits and why sharing vectors beats exact-count tables.
Chapter 7
3Blue1Brown
A visual tour of a GPT from input text to next-token probabilities — ideal before or right after Chapter 7.
Covers: Tokens, embeddings, the flow of data through a GPT, softmax and temperature.
3Blue1Brown
Animates exactly what queries, keys and values do. Watch it alongside the Attention Explorer.
Covers: Queries, keys, values, the attention pattern, masking, multi-head attention.
3Blue1Brown
The feed-forward half of a Transformer block gets less attention than attention; this fixes that.
Covers: MLP sublayers, directions in embedding space, superposition (intuition).
Andrej Karpathy
The best way to reach IMPLEMENT level on Transformers: write one yourself, line by line, in PyTorch.
Covers: Self-attention, multi-head attention, masking, residuals, layer norm — all built from a bigram baseline up.
Chapter 8
Andrej Karpathy
Many odd LLM behaviours trace back to tokenization; this shows you why by building a BPE tokenizer.
Covers: Unicode, bytes, byte-pair encoding, GPT-2/GPT-4 tokenizers, special tokens.
Andrej Karpathy
A clear one-hour overview of what LLMs are, how they are trained, and where they're going — good orientation for Part III.
Covers: Pretraining, fine-tuning, scaling, tool use, security issues.