Practice track

Classical ML

The models that come before deep learning, written from the equations. 6 problems, about 160 minutes. Do them in order: each problem uses ideas from the problems before it.

0 / 6 solved

  1. 01
    Linear regression by gradient descent

    Mean squared error, its gradients for weights and bias, and a batch gradient descent loop that records the cost after each update.

    From Linear Regression

    ImplementEasy20 min
  2. 02
    Train softmax regression on four blobs

    Train multinomial logistic regression with gradient descent to reach a held-out accuracy and log loss target on four Gaussian blobs.

    From Logistic Regression

    TrainEasy25 min
  3. 03
    K-means assignment and update

    The k-means assignment and update steps with a tie rule and an empty cluster rule, and a full run until the assignments stop changing.

    From Unsupervised Learning

    ImplementMedium25 min
  4. 04
    Logistic regression from scratch

    A stable sigmoid, the binary cross-entropy loss and its gradient, and a gradient descent loop that records the loss.

    From Logistic Regression

    ImplementMedium25 min
  5. 05
    Measure bias and variance

    Fit polynomials of degree 1 to 12 on resampled training sets and measure bias squared, variance and test error at each degree.

    From Bias-Variance Tradeoff

    LabMedium30 min
  6. 06
    Gini impurity and the best split

    Gini impurity and the best decision tree split over all features, with midpoint thresholds, weighted child impurity and a fixed tie rule.

    From Decision Trees and Random Forests

    ImplementHard35 min