Lectures

Every class of the January–April 2019 offering, numbered in order, with its slides, readings and notebooks. Notebooks open in Colab.

SlidesNotebookReading

Foundations and decision trees

Lectures 1–4
Lecture 01

Introduction and logistics

Lecture 02

Accuracy metrics; decision trees I

Reading: Tom Mitchell, Machine Learning, chapter 3.

Lecture 03

Decision trees II and III; bias and variance

Lecture 04

Ensemble learning

Bagging, boosting and random forests.

Linear models and optimisation

Lectures 5–14
Lecture 05

Linear regression I; maths for ML I

Reading: An Introduction to Statistical Learning, chapter 3.

Lecture 06

Paper presentations I

Lecture 07

Linear regression II

Slides as in lecture 5.

Lecture 08

Maths for ML II; feature selection; gradient descent

Lecture 09

Paper presentations II

Lecture 10

Gradient descent and SGD: a worked example

Lecture 11

Paper presentations III

Lecture 12

GD versus SGD; KKT conditions; convexity; ridge regression

Lecture 13

Subgradients, lasso and coordinate descent

Lecture 14

Project phase I presentations

Neighbours, Bayes and active learning

Lectures 15–19
Lecture 15

K-nearest neighbours

Parametric versus non-parametric methods. Reading: An Introduction to Statistical Learning, section 2.1.2.

Lecture 16

Curse of dimensionality; naive Bayes

Why KNN is non-parametric.

Lecture 17

Categories of ML; active learning

Lecture 18

MLE, MAP and Bayesian estimation I

Lecture 19

MLE, MAP and Bayesian estimation II; SVM I

SVMs, logistic regression and neural networks

Lectures 20–26
Lecture 20

SVM II

Followed by ML demo presentations.

Lecture 21

SVM III

Lecture 22

ML demos

Lecture 23

SVM IV; logistic regression

Lecture 24

SVM duality; neural networks I

Lecture 25

Neural networks II

Slides as in lecture 24. Quiz 3 in class.

Lecture 26

Dropout; unsupervised learning

Slides are the PDFs used in class. Paper presentations and project presentations were student sessions.