Applying a Stopping Condition in Sequence Expansion
A language generation algorithm is building sequences step-by-step. Given the information below, determine the full set of new candidate sequences that will be generated for the next step. In your answer, you must also explain the rule that determines which of the current sequences are expanded and which are not.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Application in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
Notation for the Set of Complete Sequences
In a step-by-step sequence generation process, a set of candidate sequences is maintained and expanded at each step. Suppose at a given step, the current set of candidate sequences is:
["The cat sat", "The dog ran ⟨EOS⟩", "The cat slept on"]Assuming
⟨EOS⟩is a special token indicating the end of a sequence, which of these sequences will be used as a basis for generating longer sequences in the next step?Applying a Stopping Condition in Sequence Expansion
Efficiency of Sequence Expansion