Learn Before
Path in Decoding Search Tree as Output Sequence
In the search tree representation of a large language model's search space, any continuous path from the root node to another node corresponds to a specific generated output sequence. This structure enables efficient traversal of possible sequences, where the overall quality of each sequence is evaluated by its log-probability, calculated as the sum of the log-probabilities of all the individual nodes along its respective path.
0
1
Tags
Foundations of Large Language Models
Ch.5 Inference - 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