Every day, billions of people interact with recommender systems without ever naming them. The film you were nudged toward, the next track that started playing on its own, the product placed at the top of a store page, the post at the top of a feed, the code completion your editor suggested, and the document your enterprise search surfaced first — all of these are recommendations. A recommender system is any system that, from a very large set of possible items, selects a small, personalized subset to show a specific user in a specific context. That is a deceptively simple definition for one of the highest-leverage applications of machine learning in existence.
Educational note: This course is for learning. Recommender systems operate on behavioural data about real people, so they sit squarely inside data-protection law. Any system you build against real user data must respect the GDPR in the EU, including lawful basis, the rules on automated decision-making and profiling, and transparency. We return to these obligations in a dedicated module — including the Digital Services Act duties that now apply to platform recommender systems — because building recommenders responsibly is part of building them well.
Why recommendation is a distinct problem
It is tempting to treat recommendation as "just another classification or regression task", but it has properties that make it its own discipline.
First, the number of items is enormous — millions of products, hundreds of millions of videos — so you cannot simply score every item for every user in real time without careful engineering. If scoring one user-item pair costs even a tenth of a millisecond, scoring a ten-million-item catalogue for one request would take a thousand seconds. Production systems answer in tens of milliseconds, which forces an architecture (retrieval then ranking) that no ordinary classifier needs.
Second, the data is extremely sparse: any given user has interacted with a vanishingly small fraction of the catalogue, so most of the user-item matrix is unknown. A supervised learner usually has a label for every training row; a recommender must reason about a matrix in which more than ninety-nine percent of the cells were never observed at all.
Third, most of the signal is implicit — clicks, plays, dwell time, purchases — rather than explicit star ratings, and the absence of an interaction does not cleanly mean dislike. The user probably never saw the item. This asymmetry between observed positives and ambiguous blanks reshapes the loss functions, the negative sampling, and the evaluation of every model you will build.
Fourth, the system changes the very data it learns from: what you recommend is what gets clicked, which becomes tomorrow's training data. This feedback loop has no equivalent in a static classification problem and is the source of many of the field's hardest issues — exposure bias, popularity spirals, and filter bubbles all grow out of it.
Fifth, the problem is non-stationary. Catalogues change hourly, user interests drift with seasons and life events, and a model frozen for three months quietly decays. Recommendation is a lifecycle, not a one-off fit.
Finally, recommendation is multi-stakeholder. A ranking that is optimal for one user in the next ten seconds may be poor for the platform's long-term health, unfair to small item providers, or harmful at societal scale. Balancing these interests is part of the engineering job, not an afterthought.