Conceptual Understanding
Form a clear picture of loss, models and generalisation before manipulating algorithms.

AX26-AI-101 · 2026-27
Connect model assumptions to training objectives, local optimisation, and an evaluation that does not leak future information.
Write a loss, a gradient step, and a validation protocol as three different objects, and refuse to treat training error as expected risk.
01 Objectives and models 20h
Learning result Distinguish a prediction task, a model class, and a training objective.
Formative check Four-option check
02 Linear regression as an optimisation problem 20h
Learning result Derive the normal equations from squared loss and say when the design is linear in parameters.
Formative check Written derivation
03 Logistic classification and likelihood 20h
Learning result Derive binary cross-entropy from a Bernoulli likelihood.
Formative check Written derivation
04 Gradients and local descent 20h
Learning result Justify the negative gradient as a local descent direction and state the first-order remainder.
Formative check Written derivation
05 Gradient descent and learning rates 15h
Learning result For a one-dimensional quadratic, derive a constant-step interval that contracts.
Formative check Written derivation
06 Regularisation and inductive bias 15h
Learning result Prove uniqueness of the ridge solution for a strictly positive penalty parameter even when X is rank deficient.
Formative check Written derivation
07 Validation, leakage and generalisation 20h
Learning result Design a split that respects how new data arrive and exhibit a leakage failure.
Formative check Counterexample
08 Examination synthesis 20h
Learning result Assemble objective, optimiser caveat, and evaluation into one short written argument.
Formative check Written derivation
Given a prediction task, specify a model class, a loss, an optimiser limitation, and a leakage-aware evaluation.
Empirical risk, linear and logistic models, gradients, ridge, train/validation/test splits.
Report what a number measures; keep evaluation independent of fitting choices.
Form a clear picture of loss, models and generalisation before manipulating algorithms.
Choose methods and justify evaluation choices on concrete learning problems.
Derive update rules and transfer the argument to a related modelling setting.