A language model generates text by exploring a tree of possible token sequences. It employs a search algorithm that fully explores all possible sequences of length 'k' before considering any sequence of length 'k+1'. What is the primary implication of this level-by-level exploration strategy?
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
A language model generates text by exploring a tree of possible token sequences, where each level of the tree contains sequences of the same length. The process starts from a root node representing an empty sequence. If the model systematically explores all sequences of length 1 before moving on to explore any sequences of length 2, and all sequences of length 2 before any of length 3, which of the following options correctly lists the order in which the nodes (representing partial sequences) would be visited in the tree depicted below?
Tree Structure:
- Level 0:
R(Root) - Level 1 (children of
R):A,B - Level 2 (children of
A):C,D - Level 2 (children of
B):E - Level 3 (children of
C):F
- Level 0:
A language model generates text by exploring a tree of possible token sequences. It employs a search algorithm that fully explores all possible sequences of length 'k' before considering any sequence of length 'k+1'. What is the primary implication of this level-by-level exploration strategy?
Inferring Search Strategy Characteristics