Mathematical Foundations of Machine Learning
A rigorous introduction to the mathematical structures underlying statistical learning, prediction and modern machine-learning models.
- Machine Learning
- Mathematical Data Science
- Intermediate
- Online · Self-paced
Course facts
| Offered by | Gordon Institute Open School |
| Academic lead | Keith Koo |
| Level | Intermediate |
| Format | Online · Self-paced |
| Expected study | 30–40 hours |
| Language | English |
| Prerequisites | Calculus, linear algebra, probability and basic Python |
| Assessment | Exercises, investigation and final assessment |
| Recognition | Certificate of completion |
| Last reviewed | September 2026 |
Overview
Machine learning is often introduced as a collection of algorithms and software tools. This course takes a different approach. It studies the mathematical structures that make learning from data possible: probability, optimisation, linear algebra, approximation and statistical decision-making.
The course develops these foundations through a small number of recurring questions. What does it mean for a model to learn from a finite sample? Why can a simpler model outperform a more flexible one? How do assumptions about data become assumptions about prediction? When does optimisation produce a useful statistical solution rather than merely a numerical one?
The emphasis is on reasoning rather than software proficiency. Computational examples are used to connect formal results with model behaviour, but the purpose is to understand why established methods work, when they fail, and what their limitations imply for applied research.
This is not a survey of machine-learning libraries. Learners are expected to work with mathematical notation, derive results and interpret computational evidence.
Learning objectives
By the end of the course, learners should be able to:
- formulate supervised-learning problems using probabilistic and decision-theoretic language;
- explain the relationship between empirical loss, expected risk and generalisation;
- derive and interpret ordinary least squares, regularised regression and selected classification methods;
- analyse the role of convexity, gradients and numerical optimisation in model estimation;
- distinguish model complexity from computational complexity and evaluate the consequences of each;
- use simulation and numerical experiments to test mathematical claims about learning systems.
Intended participants and prerequisites
Intended participants
- advanced undergraduate or graduate students entering machine learning;
- researchers who use predictive models but want a firmer theoretical foundation;
- quantitative professionals moving from statistical modelling into modern learning methods;
- instructors seeking a mathematically coherent bridge between statistics and machine learning.
Prerequisites
- university-level calculus, including partial differentiation;
- linear algebra, including vectors, matrices, rank and eigenvalues;
- introductory probability and statistics;
- basic familiarity with Python or another numerical computing language.
Prior study of machine learning is not required. The course is unsuitable, however, for learners seeking a non-technical introduction or a software-only tutorial.
Course structure
The course is organised into six units. Each unit combines formal exposition, worked examples and a short set of analytical or computational exercises.
| Unit | Subject | Principal questions |
|---|---|---|
| 1 | Learning as statistical decision-making | How are data, models, loss functions and decisions connected? What exactly is being estimated? |
| 2 | Linear prediction and projection | Why is least squares a projection problem? Which conclusions depend on distributional assumptions? |
| 3 | Generalisation and model complexity | Why does performance on observed data differ from performance on new data? How should complexity be controlled? |
| 4 | Regularisation and constrained estimation | How do penalties encode structure? Why can biased estimates produce better predictions? |
| 5 | Classification and probabilistic boundaries | How do regression, likelihood and geometric separation lead to different classification rules? |
| 6 | Optimisation, computation and model failure | When does a numerical solution correspond to a meaningful learning solution? How can simulation expose failure? |
Teaching and assessment
Teaching is delivered through concise lectures, technical notes, worked derivations and computational demonstrations. Learners should reproduce the central derivations independently and use numerical experiments to examine cases in which theoretical assumptions are weakened.
| Component | Purpose | Weight |
|---|---|---|
| Analytical exercises | Derivation and interpretation of core results | 40% |
| Computational investigation | Simulation-based examination of model behaviour | 30% |
| Final assessment | Integrated reasoning across the six course units | 30% |
A certificate of completion is issued only when the required assessments have been completed at the stated standard. Participation alone does not constitute completion.
Faculty
Keith Koo
Professor of Artificial Intelligence and Finance
Keith Koo works across mathematical finance, statistical learning and the design of computational methods for research and professional practice.
Course faculty
Additional instructor or teaching fellow
Replace this panel when a second instructor contributes to the course. Remove the entire column when the course has one instructor.
Materials and technical requirements
Computing environment
Learners need a current web browser and access to a Python environment capable of running NumPy, pandas, Matplotlib and scikit-learn. Equivalent numerical software may be used when an exercise does not depend on a specific Python implementation.
Mathematical notation
Course notes use standard notation from linear algebra, probability and multivariable calculus. A notation guide is provided, but it is not a substitute for the stated prerequisites.
Course materials
Required readings and datasets are identified within each unit. Where external material is prescribed, the course page states whether it is freely available or must be obtained separately.
Continue to the course
Enter the learning platform to access the lectures, readings, exercises and assessments for this course.