Learn Before
LLM Text Generation as a Search Problem
In the context of a Large Language Model (LLM) generating text, the process can be viewed as a search for the best sequence of words. Consider the following scenario and explain how the core operation of 'expansion' is demonstrated.
0
1
Tags
Ch.3 Prompting - 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
Expansion Function in Search Algorithms
An algorithm is searching for a path from a starting point (Node A) to a goal (Node F) in a simple network. The network connections are: A-B, B-C, B-D, C-E, D-E, E-F. The algorithm is currently at Node B and needs to perform an expansion step to identify the next possible nodes to visit. Which statement best analyzes the fundamental trade-off inherent in how this expansion step is designed?
LLM Text Generation as a Search Problem
A search algorithm is designed to find a solution within a problem's state space. Arrange the following core operations of a single iteration of such an algorithm in the correct logical sequence, starting from the selection of a state to explore.
Node Expansion in Step-Level Search