A model run in a loop with tools and a goal, until it finishes or hits a limit.
Not a persistent being. The loop is a program somebody wrote, and it stops.
Glossary
A term only appears as a chip in the text after the node that introduces it. Where a term is commonly confused with another, the distinction is stated rather than left implied.
A model run in a loop with tools and a goal, until it finishes or hits a limit.
Not a persistent being. The loop is a program somebody wrote, and it stops.
Write a step, run the tool, put the result back, look again. The agency lives here, not in the model.
The broad term for shaping a model to behave as intended. Mostly happens in post-training.
The HTTP endpoint that takes an assembled context and returns tokens.
The operation where each token weights every earlier token and pulls in a blend of them.
Not focus or intent. It is a similarity score, computed and applied.
A complete record of every action taken, including the ones that were blocked.
Producing one token at a time, each conditioned on everything already written.
Working backwards through the layers to compute how much each parameter contributed to the error.
A point where everything waits for everything else. Justified only when a stage needs all prior results at once.
How much damage one wrong action can do. Guardrails shrink this; they do not make the model reliable.
The method that builds the vocabulary: start from bytes, repeatedly merge the most frequent adjacent pair, stop at the target size.
Not a compression format, though it began as one.
Tokens a model produces working through a problem before giving its answer. Ordinary output, produced by the ordinary loop.
Not a window into the computation. It is text the model generated, and it can be wrong while the answer is right, or the reverse.
The special tokens a given model family uses to mark role boundaries. Using the wrong one degrades output quietly.
A saved copy of the weights at some point during training.
Cutting documents into passages small enough to retrieve and large enough to still mean something.
Replacing a long history with a short summary mid-run so the window can keep going.
The fixed token allowance for one turn, and the competing claims on it.
The single sequence of tokens the model is given each turn, and its maximum size.
Not memory. It is rebuilt from scratch by a program on every turn.
The collected text a model is trained on, after filtering and deduplication.
Not a database the model can consult later. It is gone by the time the model runs.
How alike two vectors are, measured by the angle between them rather than the distance.
Writing the answer, one token at a time. Sequential, and the reason output costs more.
Removing repeated and near-repeated documents, typically discarding 20-50% of raw crawl.
One of the thousands of numbers in a vector. Individually they mean nothing readable.
A list of numbers standing for a token or passage, positioned so similar things sit near each other.
A token’s input embedding is fixed; its hidden state at a later layer is not. Both get called “the embedding”.
A capability that is absent at one scale and present at a larger one, without appearing gradually in between.
Not magic, and not well explained. Partly an artifact of measuring with pass-or-fail tests.
A fixed set of cases with known good outcomes, run on every change rather than every release.
Removing something from the context to make room. The model is never told what went.
A confident, plausible, false output. Often called hallucination.
Not a malfunction. Producing the most plausible continuation is exactly what the model was trained to do.
Running independent work side by side. Costs N times the tokens for roughly the time of the slowest.
Training an existing model further, producing a new file or a small companion adapter.
Does not edit the original weights, and is not how a chat appears to remember you.
One run of the token sequence through every layer, producing one probability distribution.
A small block of machine-readable metadata at the top of an otherwise human-readable file.
The model writing a structured request to run a tool, which your code then decides whether to honour.
The model never runs anything itself.
The fact that one model trained on one objective can do many unrelated tasks it was never specifically taught.
Not evidence of understanding. It is what predicting text well enough turns out to require.
Nudging every parameter in the direction that would have reduced the loss, over and over.
Holds relationships and answers what connects to what.
Always taking the single most likely token. Repetitive, and still not truly deterministic in production.
One parallel attention computation. Different heads specialise, and the specialisation is learned.
Running the finished file over some text to produce more text. The second of the two halves.
Not learning. Nothing is stored and nothing changes during inference.
A plain text file of standing rules, pasted into the context on every turn.
Nothing parses it. Its contents arrive as text like anything else.
The usual format for describing a tool. Its description field is the only documentation the model gets.
Generating several candidate answers and scoring them independently, to catch errors one confident run would not.
Returns a thing by its name, very fast. Suits sessions, caches and saved summaries.
The date the training data was collected. Nothing after it exists to the model.
Stored intermediate values for tokens already processed, so each new token avoids recomputing them.
A file of numbers that, given a sequence of tokens, produces a probability for every token that could come next.
Not a program with rules in it, and not a search over stored documents.
One stage of the stack: attention across positions, then a transform of each position.
How large each nudge is. Too small and it crawls; too large and it diverges.
Giving each tool the narrowest permission that still lets it work.
The raw scores over the whole vocabulary, before they are turned into probabilities.
One number measuring how wrong a prediction was. The entire training process minimises it.
The measured tendency to use information at the start and end of a long context more reliably than the middle.
Plain text with a few visible conventions for headings, lists and code, readable by both a person and a model.
A shared convention for exposing tools and data, so any client can connect to any provider without bespoke wiring.
In this site, always the file of weights. Not the chat product, not the company, not the API.
People say "the model" for the whole product. Almost every misconception starts there.
Using a second model to grade output that resists automatic checking. Good at comparisons, poor at absolute scores.
One adjustable number inside the model. Training changes these and nothing else.
Not a fact or a rule. No single parameter holds any one thing.
Anything that survives between runs. All of it lives outside the model, in a file or a store.
Items flowing through stages independently, so nothing waits for the slowest item at each step.
Adjusting the model toward responses humans ranked higher. RLHF is one method of doing it.
Reading the prompt. Happens in one parallel pass, and sets the time to the first word.
The long first training run, where the only objective is predicting the next token.
Reusing an unchanged prefix across requests at a discount. Why stable content belongs first.
Text arriving from a document, page or tool result that the model follows as if it were an instruction.
Not a bug waiting to be patched. It follows from everything being one string, and it is handled with permissions.
Attention work grows with the square of the input length, so doubling the input roughly quadruples it.
Storing parameters at lower precision to shrink the file and speed it up, at some cost to quality.
The three projections of each token: what it is looking for, what it offers, and what it passes on.
Retrieval-augmented generation: fetching relevant passages and pasting them in before the model answers.
Reordering the top candidates with a slower, more accurate model before they go in the window.
Declining a request. A trained behaviour, not a hard rule the machine enforces.
A change that fixes one class of failure and breaks another. The reason a single aggregate score hides things.
Structured records, queried exactly. Answers how many and which, not what resembles this.
A label marking who a piece of the context came from: system, user, assistant, or a tool.
The observed relationship between how much data, compute and parameters go into a training run and how well the result predicts text. Smooth, and predictive of loss.
They predict the loss, not what the model will be able to do.
A library wrapping that endpoint in your language.
The step that turns raw scores into probabilities summing to one.
A saved fact that is out of date being recalled with exactly the same confidence as a current one.
Holding no memory between calls. The model is stateless; the program around it is not.
What ends the loop: a declaration of success, an iteration cap, a spend cap, or a failure.
Sending each token to the screen as it is chosen, which is why an answer appears to type itself out.
A separate run with its own clean window and a narrow brief, returning a summary to a coordinator.
Replacing completed work with a short account of it to free room. Lossy, and the loss is silent.
Marking a saved fact as replaced rather than overwriting it silently, so the change is visible.
Training on examples of requests and good responses, which teaches the assistant format.
Standing instructions placed at the front of the context on every turn.
Not a setting the machine enforces. It is text the model was trained to weight heavily.
How much the odds are flattened before a token is drawn. Low concentrates, high spreads.
Not a creativity dial. It reshapes fixed odds; it does not change what the model considered.
Spending more work at the moment of answering rather than during training, usually by generating more tokens before the reply.
Not a different mechanism. It is the same loop, run for longer.
A chunk of characters with a fixed ID. It is the unit a model actually reads, and the unit you are billed in.
Not a word and not a syllable.
The program that cuts text into tokens and back again, using a vocabulary fixed when the model was built.
An ordinary function your program exposes to the model by describing it in the context.
Whatever your code returned, pasted back into the context as plain text. Also where untrusted content enters.
Keeping only the k most likely candidates before drawing one.
Keeping the smallest set of candidates whose probabilities sum to p. Also called nucleus sampling.
The one-off process that produced the file, by adjusting its numbers until it predicted text well.
Not something that happens while you talk to it. It finished before you arrived.
The architecture almost every current language model uses: stacked attention and feed-forward layers.
An ordered list of numbers treated as a coordinate in a space of many dimensions.
Stores embeddings and answers what is most similar to this. The only one of the four specific to AI.
Finding stored passages nearest to a question in embedding space.
Misses exact terms like names and error codes, which is why production systems add keyword search.
The complete fixed set of tokens a model knows, each with an ID. It never changes after training.
The frozen parameters written to disk. This file is the model.