1. Overview of the area
The first question for any ML problem is what kind of signal the data carries. If every example has a target value, the problem is supervised: classification for discrete targets, regression for continuous ones. If there are no targets, unsupervised methods find structure such as clusters, low-dimensional manifolds, or outliers. When only a small fraction of examples is labelled, semi-supervised and self-supervised methods use the unlabelled majority to learn representations first. When the feedback is a delayed reward from an environment rather than a correct answer, the problem is reinforcement learning. Time-ordered data adds its own constraints (no shuffling, no leakage from the future) and gets a dedicated forecasting page.
2. Topics in this section
3. When to use which
| Situation | Start with | Typical first model |
|---|---|---|
| Tabular data with a labelled target | Supervised | Gradient-boosted trees |
| Images or text with plenty of labels | Supervised + framework | Fine-tuned pretrained network |
| Large unlabelled corpus, few labels | Self-supervised | Pretrained encoder + small head |
| Segment customers, find outliers | Unsupervised | k-means, isolation forest |
| Sequential decisions with rewards | Reinforcement | DQN or PPO |
| Predict future values of a series | Forecasting | Seasonal baseline, then boosted trees |
| Rank items per user | Recommender | Matrix factorisation, then two-tower |
A practical rule: always build the simplest baseline first (majority class, last value, popularity ranking). It tells you whether a sophisticated model is earning its complexity, and it catches data leakage early when the baseline looks suspiciously strong.
4. Related areas
Machine learning sits underneath the language-model material elsewhere on the site. The AI section covers LLM engineering and retrieval-augmented generation, which reuse the same ideas of embeddings, evaluation and fine-tuning at a much larger scale.