Learn Before
Node Expansion in Step-Level Search
Node expansion in step-level search involves using a Large Language Model to generate subsequent reasoning steps for a given partial path . The LLM produces one or more candidate next steps, denoted as . Each candidate step is then individually appended to the current path to create a new, extended potential partial path, formatted as , which is then evaluated or further expanded.
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
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
Learn After
A reasoning system is tasked with solving a complex problem and has generated an initial partial solution: 'To determine the sentiment of the customer review, the first step is to identify all adjectives used.' The system now needs to perform an expansion operation to explore potential next steps in its search for a complete solution path. Which of the following descriptions best illustrates this specific expansion process?
Applying Node Expansion in a Reasoning Task
An AI assistant is trying to answer the question: 'What was the primary cause of the company's Q3 revenue decline?' It has already formed a partial reasoning path and now needs to perform a node expansion. Arrange the following actions into the correct sequence for a single node expansion operation.