AI CompendiumA public chart of the language
Home / Foundations / Machine Learning
Foundations

Machine Learning

also called ML

Programs that improve from examples instead of explicit instructions.

Definition

A field of AI where a system learns a statistical pattern from data rather than being hand-coded with rules. You supply examples; the algorithm finds the mapping.

Classical ML — regression, decision trees, gradient boosting — still runs a huge amount of production software: fraud scoring, ranking, forecasting. It is cheaper, smaller and far more explainable than an LLM, and for a lot of problems it is the correct answer.

The distinction that matters in practice is not supervised versus unsupervised, it is whether you can write down your objective as examples. If you can, you can learn a mapping. If you cannot, you are back to rules — and rules break quietly on the inputs you did not enumerate.

How people use it
An engineer pushing back on reaching for an LLM.
"This is a classification problem with clean labels. We do not need a language model, a gradient-boosted tree will do it in milliseconds."
Worked example

When a rule beats a model

A team wants a model to decide whether an invoice total is arithmetically valid.

You do not need learning here: adding the line items is exact, cheap and explainable. Reserve the model for the judgement calls — is this line item plausible for this vendor — where no rule survives contact with reality.

Avoid

Reaching for a generative model when the task has a fixed label set and good training data.

Sources
Related terms