Learn Before
Growth of the Generative Search Space
A language model generates text by adding one token at a time from a fixed vocabulary. Explain how the total set of all possible output sequences changes in size as the length of the generated sequences increases. Describe the mathematical nature of this growth and its primary implication for the task of finding the 'best' possible sequence.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Analysis in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
Formula for the Search Space as a Union of Complete Sequences
Formula for the Expansion of the Search Space at Each Step
A simplified language model has a vocabulary consisting of only three unique tokens: 'cat', 'sat', and 'on'. The model is configured to generate an output sequence with a fixed length of exactly two tokens. Which of the following options correctly represents the complete set of all possible output sequences the model can generate?
Analyzing Search Space Dimensions
Growth of the Generative Search Space
Mathematical Formulation of the Search Problem in LLM Inference