Create an account to study the free first module. Start free.
Each session opens with a from-scratch ramp (concrete problem → interactive demo → plain-English math), then a formal treatment, cheatsheet, and practice — smooth to hard, not the other way around. Citations point back to Mitchell (Source), Bishop (Source), Tan/Steinbach/Kumar (Source), and Burges (Source).
October 2026 exam format: closed-book midsem; open-book comprehensive (final). Check your cohort’s latest instructor instructions for permitted materials.
Machine learning is what you reach for when the rules are too long to write by hand. The course builds a small number of families of models — linear, tree, distance-based, probabilistic, ensemble — and asks you to understand each well enough to implement it on toy data, diagnose its bias-variance behaviour, and choose the right evaluation metric.
The course is layered on top of the math foundation: gradient descent, regularisation, and the matrix identities that power logistic regression all live a few modules back. The first sessions are deliberately gentle; the mid-course review (S08) is the pivot where everything starts connecting.
What you walk away with is a working mental model of when each family wins, plus a habit of asking four questions before fitting anything: where does the experience come from, what is the target function, what is the representation, and what is the search algorithm.
Every session of this course is a different filling of the same five slots. Different models, different losses — but the pipeline is identical.
Open any session to get the from-scratch ramp, formal notes, cheatsheet, and practice set. Track groups below show the recommended order — S08 is the mid-course pivot, S15 is where everything comes together for evaluation.
Same sessions, just ungrouped — for skim-review or to jump to a specific number.
What is ML, why it matters, taxonomy, designing a learning system, issues in ML.
Role of data, preprocessing, sampling, training, metrics for testing.
Closed-form solution, gradient descent (batch / stochastic / mini-batch), basis functions.
Bias-variance decomposition, discriminant functions, decision theory, intro to logistic regression.
Logloss, gradient descent, multi-class logistic regression.
Information theory, entropy-based construction, overfitting, MDL pruning, continuous & missing attributes.
k-Nearest Neighbours, locally weighted regression, radial basis functions.
Map of sessions 1-7, five big ideas, formula sheet, decision-boundary sketches, book/resource map.
Linearly / non-linearly separable data, kernel trick (Mercer), structured & unstructured data.
MLE, MAP, Bayes rule, optimal Bayes classifier.
Naïve Bayes classifier, probabilistic generative classifiers, Bayesian interpretation of linear regression.
Combining classifiers, bagging, random forests, boosting intro.
AdaBoost, gradient boosting, XGBoost.
K-Means clustering, EM review, mixture models for soft clustering, applications.
Comparing ML models, bias, fairness, interpretability.
For course navigation and interactive practice, please use the live app. Offline PDF generation is disabled.