Learn Before
Root of the Search Tree as Input Representation
In the search tree model for LLM inference, the root node can be understood as the representation of the input sequence, . This is because all generated sequences, or hypotheses, originate from this root and are conditioned on the initial input context it provides.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Breadth-First Search for Left-to-Right Token Generation
Root of the Search Tree as Input Representation
Expansion Step in Sequence Generation
In the process of generating an output, a language model considers two different candidate sequences:
Sequence A: 'The quick brown'andSequence B: 'A fast red'. Based on the conceptual model where token generation is a search through a tree, what is the most accurate statement regarding the positions of these two sequences within that tree?In the conceptual search tree for language model output generation, traversing from a parent node to one of its child nodes represents the action of appending a new token to the sequence represented by the parent node.
A language model is generating an output and has produced the following three candidate sequences:
S1: 'The cat sat',S2: 'The cat sat on', andS3: 'The dog ran'. According to the conceptual model of token generation as a search through a tree, which statement accurately describes the relationship between the nodes representing these sequences?Path in Decoding Search Tree as Output Sequence
Learn After
When modeling language generation as a search through a tree of possible token sequences, which statement best distinguishes the role of the tree's root node from the role of a node at the first level (a direct child of the root)?
Interpreting the Search Tree Root
In the search tree model used for generating text, the root node represents the first predicted token in the output sequence.