Rosetta Stone · 29 of 30
Argmin (the input that minimises)
Operator: it does something
In plain English
Not the minimum value, but where it occurs. is the lowest value of ; is the that achieves it. Training a model is, in principle, an argmin over parameters: find the that makes the loss smallest. In practice, training finds a good-enough , not provably the best one. is the mirror image (e.g. greedy decoding picks the argmax token).
As code
const xs = [-2, -1, 0, 1, 2, 3];
const f = (x) => (x - 1) ** 2;
const minValue = Math.min(...xs.map(f)); // min: 0
const argmin = xs.reduce((b, x) => (f(x) < f(b) ? x : b)); // argmin: 1Where the analogy bends: Exhaustive search over a list. Real argmins over billions of parameters are approximated by gradient descent.
See it
What it means, field by field
Training objective θ* = argmin_θ L(θ); greedy decoding = argmax over next-token probabilities.
Systems at low temperature settle toward energy minima; the principle of least action selects paths that make the action stationary.
Optimality models (e.g. optimal foraging) posit behaviours that maximise a payoff. Whether evolution actually achieves the optimum is an empirical question.
Optimisation; argmin may be a set (several minimisers) or not exist.
In a research paper
For a fixed compute budget C, which model size and token count give the lowest loss?
Common misreadings
Confusing argmin with min, i.e. the location with the value.
Assuming a trained network sits at the argmin. Training finds a low point, not a certified global minimum.
Assuming nature "optimises" because a quantity can be written as an argmin.