JJoeven

Curriculum

Machine Learning

Simple ML from zero: examples, splits, loss, ranking, and the loop you use to judge an agent.

  1. 01

    What Is Machine Learning?

    ML fits a function from examples, then checks it on data it has not seen. That habit is how you ship agents.

    20 min
  2. 02

    Features

    A feature is a number the model is allowed to see. Garbage features make garbage agents.

    20 min
  3. 03

    Data and Splits

    Train, validation, and test sets — and the leakage bugs that make agent evals lie.

    21 min
  4. 04

    Baselines

    Always beat a dummy: majority class, last week’s prompt, or a keyword rule. If you cannot, you do not have a win.

    19 min
  5. 05

    Supervised Learning

    Every training row has an input x and a target y. No labels, no supervised learning.

    20 min
  6. 06

    Loss Functions

    A loss is a number that is small when the model is right. Training is making that number go down.

    21 min
  7. 07

    Gradient Descent

    Measure how the loss changes when you nudge a knob, then nudge the knob downhill.

    21 min
  8. 08

    A Linear Classifier

    A score, a sigmoid, a cutoff. This is the shape of every routing head you will train.

    20 min
  9. 09

    Hyperparameters

    Learning rate, epochs, batch size, and seeds are knobs you choose — on validation, not on test.

    19 min
  10. 10

    Overfitting

    The model fits the training sample, including accidents, instead of the pattern that will appear tomorrow.

    21 min
  11. 11

    Regularization

    A prior that says be boring: smaller weights, shorter prompts, fewer tools, stop when validation worsens.

    20 min
  12. 12

    Metrics That Matter

    Accuracy lies when classes are rare. Count TP, FP, FN, TN. Then precision, recall, and F1.

    21 min
  13. 13

    Rare Classes and Thresholds

    When the important class is rare, move the cutoff on validation. Accuracy will not tell you.

    20 min
  14. 14

    Calibration

    A score of 0.9 should be wrong about one time in ten. Uncalibrated agents shout 99% on everything.

    20 min
  15. 15

    Ranking

    Retrieval and rerank are not classification. Sort by a score and measure precision at k.

    21 min
  16. 16

    Embeddings

    Meaning as a list of numbers. Close lists rank together. Retrieval is geometry.

    21 min
  17. 17

    Nearest Neighbors

    k-NN labels a new point by a vote of its nearest labeled points. Retrieval is the same geometry without the vote.

    20 min
  18. 18

    Unsupervised Learning

    No labels: find structure. Tiny 2-d k-means, then name the clusters by hand.

    21 min
  19. 19

    A Tiny Neural Net

    A one-hidden-layer forward pass with lists — linear maps, ReLU, and why depth needs a bend.

    22 min
  20. 20

    Train vs Inference

    Training updates knobs. Inference freezes them and only runs the forward pass. APIs you call are inference.

    19 min
  21. 21

    Drift

    The world moves. A model fit on last quarter’s words fails on this quarter’s words. Watch the slice.

    20 min
  22. 22

    Rewards and Policies

    A policy maps a state to an action. A reward says how well that went. Agents already live in this loop.

    21 min
  23. 23

    Rules, Prompts, or Train

    Start with a rule. Then a prompt. Train a small model when the remainder is large, stable, and labeled.

    20 min
  24. 24

    Traces as a Dataset

    Production logs are the dataset. Freeze ids, write a rubric, label a sample, version the split.

    22 min
Start this track