Evaluating a Search Space Construction Method
An engineer is building a system to generate short sentences. The system runs for a maximum of 4 steps. The engineer's code defines the final set of all possible outputs by only taking the complete sentences found at the final step (step 4). Analyze this approach. Is it correct? Explain why or why not, and describe the consequence of this method on the final set of outputs based on the provided test run.
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
In a step-wise sequence generation process, let
Ψ(Y_i)denote the set of output sequences that are considered complete at stepi. Suppose after running the process for three steps, the following sets of complete sequences have been identified:Ψ(Y_1)= { "The cat." }Ψ(Y_2)= { }Ψ(Y_3)= { "It sat.", "A dog." }
Based on the principle that the total search space
Yis the aggregation of all complete sequences found across all steps, what is the resulting setY?Consider a sequence generation process that runs for a maximum of 5 steps. If a particular sequence is identified as 'complete' at step 2, but the process continues to generate other sequences until step 5, that sequence from step 2 is excluded from the final aggregated search space of all possible complete outputs.
Evaluating a Search Space Construction Method