Learn Before
Example of Pruning in a Step-Level Search Tree
A step-level search can be visualized as exploring a tree where the root is the input problem, and the tree expands by generating multiple reasoning steps at each point. Each candidate step can be pruned either due to its low generation likelihood from the language model (similar to standard decoding) or by failing an explicit step-level verification check. The surviving unpruned candidates are then expanded to generate further reasoning steps. This continuous process of expansion and pruning allows the system to focus computational resources on the most promising paths, iterating until a complete reasoning chain forming a final answer is generated or a predefined search limit is reached.
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
Benefits of Step-Level Search with Verifiers
Core Components of Step-Level Search with Verifiers
Comparison of Step-Level Search Verifiers and Standard Decoding
Challenges of Step-Level Verification
Step-Level Search as a Tree Search Problem
Example of Pruning in a Step-Level Search Tree
An AI system is tasked with solving a complex, multi-step logic puzzle. The system generates the first step of a potential solution. Which of the following actions best demonstrates the core principle of a step-level search that uses a verifier?
Analyzing a Reasoning Failure in an AI System
An AI system is tasked with solving a multi-step mathematical problem using a search process that integrates a verifier at each stage. Arrange the following actions in the logical order that reflects this specific approach.
Learn After
A system is solving a multi-step problem by exploring different reasoning paths. It starts with two initial paths, Path X and Path Y. After the first step, it runs a verification check. Path X's first step is found to be logically sound. Path Y's first step is found to contain a factual error. The system continues to expand only the valid path for two more steps to reach a final answer. Based on this process, what is the most likely outcome?
Analyzing a Search Process
A system is solving a problem by exploring multiple reasoning paths one step at a time. Arrange the following events to show the correct logical sequence that occurs within a single iterative step of this process.