Neural Networks and Deep Learning

Lecture 2 · Game: Fast or slow training? A training-curve game

Fast or slow training? A training-curve game

Every chart in this game is a real training run of Lecture 2. You see how the error of the network evolves, epoch by epoch, and you say which setting produced the curve: the learning rate, the batch size or the optimiser. Nine charts, about three minutes.

The first six runs fit a multilayer perceptron (MLP 64-64) to the 20,640 Californian census block groups of the lecture; the chart shows the mean squared error (MSE) on 4,128 validation block groups the network does not train on (lower is better). The last three runs detect card fraud; the chart shows the area under the precision-recall curve (PR-AUC) on the validation transactions (higher is better). There is no model to beat here: only your score counts.

Class board for the projector

Data: California housing, 1990 census (Pace and Barry, 1997; StatLib), split 60/20/20 at random; card fraud of the Université libre de Bruxelles (ULB) and Worldline, Open Machine Learning platform (OpenML) dataset 1597, split by time. Curves: the runs of analysis_L2.py (seed 20261108; cached in lectures/L2/cache). Code: lectures/L2/make_game_L2.py.