Advanced · module A3
Advanced Mathematics for AI
By the end: Read and work with the mathematics in machine learning papers
- Covers
- The linear algebra, calculus, probability, information theory and optimisation used in modern deep learning
- Contents
- 5 chapters, 15 topics
- Time
- About 4 hours
- Level
- Advanced
- Your progress
- 0 / 15
This module builds on Mathematics for AI. We suggest looking at it first, but the choice is yours.
Chapter 1 Linear Algebra
- 1.115 minBeing written
Linear Transformations and Rank
Matrices as transformations, span, basis and rank
Code: visualise a transformation
- 1.215 min Read
- 1.315 minBeing written
Singular Value Decomposition
Decomposition and low-rank approximation
Code: compress an image with SVD
A = UΣVᵀ
Chapter 2 Calculus
- 2.115 min Read
Multivariable Calculus and Gradients
Partial derivatives and the gradient vector
Code: numerical gradients
∇f = [∂f/∂x₁, …, ∂f/∂xₙ]
- 2.220 min Read
The Chain Rule and Automatic Differentiation
How backpropagation follows from the chain rule
Code: a tiny autograd engine
∂L/∂x = ∂L/∂y · ∂y/∂x
- 2.312 minBeing written
Jacobians and Hessians
Second-order information and curvature
Code: compute a Hessian
Chapter 3 Probability and Statistics
- 3.115 minBeing written
Probability Distributions
Bernoulli, binomial, Poisson, normal, multivariate normal and others
Code: sample and plot distributions
- 3.215 min Read
Maximum Likelihood and MAP Estimation
Where common loss functions come from
Code: derive and fit a model by MLE
θ̂ = argmax Σ log p(xᵢ|θ)
- 3.312 minBeing written
Bayesian Inference
Priors, posteriors and uncertainty
Code: Bayesian coin estimation
Chapter 4 Information Theory
- 4.115 min Read
Entropy, Cross-Entropy and KL Divergence
Measuring uncertainty and the difference between distributions
Code: compute all three
H(p,q) = −Σ p log q
Chapter 5 Optimisation
- 5.112 minBeing written
Convex Optimisation
Convex functions, minima and why convexity helps
Interactive: convex and non-convex surfaces
- 5.215 minBeing written
Optimisers: SGD, Momentum, RMSProp and Adam
How modern optimisers adjust each step
Interactive: race the optimisers
θ ← θ − η·m̂ / (√v̂ + ε)
- 5.312 minBeing written
Constrained Optimisation
Lagrange multipliers and duality
Code: solve a constrained problem
L = f(x) + λg(x)
- 5.410 minBeing written
Numerical Stability
Overflow, underflow and stable softmax
Code: make a function stable
- 5.520 minBeing written
Module Review and Assessment
Derivations and a scored quiz
Graded problem set