Learn Before
Ranking and 1-Best Selection Process
The Ranking and 1-Best Selection process is a decoding method that involves three main stages. First, in the Expansion stage, a set of potential next tokens is generated. Second, in the Ranking stage, these candidates are sorted based on their probabilities from highest to lowest. Finally, in the Output stage, the single token with the highest probability (the '1-best') is selected, and all other lower-probability tokens are discarded or 'pruned'.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Learn After
Example of 1-Best Selection
Ranking Stage in 1-Best Selection
Expansion Stage in 1-Best Selection
Output Stage in 1-Best Selection
Predicting the Next Word
A language model is determining the next word in a sequence. It follows a process where it first creates a list of possible words, then organizes them by likelihood, and finally chooses the most probable one. Arrange the formal stages of this process in the correct chronological order.
A language model is using a three-stage process (Expansion, Ranking, Output) to select the next word for the phrase 'The cat is...'. The model first expands the possibilities to a set of candidates with their probabilities: 'sleeping' (0.5), 'cute' (0.3), 'on' (0.15), and 'blue' (0.05). However, the model's final output is the word 'on'. Which stage of the process is the most direct point of failure?