Some background helps9 lessons77 min of readingFree, no sign-up to read
Nine lessons on how a machine actually learns from data: what fitting means mechanically, why the features you choose matter more than the algorithm you pick, how to hold out data honestly, why accuracy lies on rare events, what the classic algorithms are good at, and how gradient descent and neural networks follow from all of it. You should be able to read code. You do not need calculus, statistics, or a maths degree — every idea arrives with real numbers attached.
Start the first lesson- What a machine actually learnsLearning means adjusting the parameters of a shape you chose until a chosen error number is as small as it can be.
- With answers, and withoutA supervised model learns your labels, not the reality behind them, so who made the labels is part of the model.
- Features beat modelsAsk of every feature: at the moment I need the prediction, does this value already exist with this value?
- Train, validation, test, and the discipline of not lookingThe test set is a single-use measuring device; every peek turns it into another validation set.
- Overfitting, underfitting, and how to tellCompare training error with validation error; the gap between them, not the score itself, names the problem.
- When accuracy liesChoose the metric that matches what each kind of mistake costs, then set the threshold yourself.
- The classic algorithms, and when each is rightOn tabular data, use linear models as a floor and gradient boosting as the answer; everything else needs a stated reason.
- Gradient descent, or walking downhill in fogGradient descent only knows the slope where it is standing; the step size decides whether that knowledge helps or destroys it.
- Neural networks as the natural next stepA neural network learns its own features; the loss, the splits, the metrics and the thresholds do not change.
No ads. No data sale. No public scores on people. Ever.
© 2026 Addaly