Greedy, Top-k, and the Tree

From Logits to Tokens

Decoding starts from logits, scores over a fixed vocabulary. This lesson shows the source integers before any selection is displayed.

highlighted = computed this step

From logits to tokens

Decoding starts with logits, which are integer scores over a vocabulary. This first view shows only the shown logits and the vocab order.

vocab=[a,b,c]\text{vocab}=[a,b,c]
Step logitsDisplayed integer logits over the vocabulary.Step logitsDisplayed integer logits over the vocabulary.exact decode logitsdisplayed integer logits are the source; ties break by lowest vocab indexstep 1 logits: a=3, b=1, c=2tokenlogita3b1c2vocab order: a, b, clogits are exact integer scores; selection is not shown in this view

The first step's scores

The first step displays a=3, b=1, c=2. These integers are the source for later selection.

ℓa=3,ℓb=1,ℓc=2\ell_a=3,\ell_b=1,\ell_c=2
Step logitsDisplayed integer logits over the vocabulary.Step logitsDisplayed integer logits over the vocabulary.exact decode logitsdisplayed integer logits are the source; ties break by lowest vocab indexstep 1 logits: a=3, b=1, c=2tokenlogita3b1c2vocab order: a, b, clogits are exact integer scores; selection is not shown in this view

Summary

A decode step begins with displayed logits over the vocabulary. No probability or selection claim is needed in this opening view.

display logits first\text{display logits first}
Step logitsDisplayed integer logits over the vocabulary.Step logitsDisplayed integer logits over the vocabulary.exact decode logitsdisplayed integer logits are the source; ties break by lowest vocab indexstep 1 logits: a=3, b=1, c=2tokenlogita3b1c2vocab order: a, b, clogits are exact integer scores; selection is not shown in this view