Learn Before
Solution Selection as a Search Problem
The process of evaluating multiple potential output sequences and selecting the best one can be framed as a search problem. This framework involves two main components: a search algorithm that explores the space of possible output sequences to generate a set of candidate solutions, and a verifier that evaluates these candidates to pick the optimal result.
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
Verifiers in LLM Reasoning
The Predict-then-Refine Paradigm in NLP
Self-Refinement in LLMs
Generating and Verifying Thinking Paths
Solution Selection as a Search Problem
Reasoning Path in Problem Solving
Best-of-N Sampling (Parallel Scaling)
Comparison of Parallel Scaling and Self-Refinement
Verifier
Solution as a Sequence of Reasoning Steps
A team is developing a system to solve complex mathematical word problems using a large language model. Their goal is to maximize the final answer's accuracy. Which of the following strategies best exemplifies a process where multiple potential solutions are first generated and then evaluated to select the most reliable one?
Analyzing LLM Reasoning Strategies
A system is designed to solve a complex problem by first generating multiple possible answers and then selecting the best one. Arrange the following steps to accurately represent this two-stage workflow.
In a system designed to solve a problem by first generating multiple potential solutions and then using a separate component to select the best one, the quality of the final selected answer depends solely on the generative capability of the initial model.
You are reviewing a proposed architecture for an i...
You’re designing an internal LLM assistant for a f...
You’re leading an internal rollout of an LLM assis...
In an LLM-based customer support assistant, the mo...
Design Review: Combining Tool Use, DTG, and Predict-then-Verify for a High-Stakes API Workflow
Designing a Reliable LLM Workflow for Real-Time Decisions
Post-Incident Analysis: Preventing Confidently Wrong API-Backed Answers
Case Study: Shipping a Tool-Using LLM Assistant with Built-In Verification Under Latency Constraints
Case Review: Preventing Incorrect Refund Commitments in an LLM + Payments API Assistant
Case Study: Preventing Hallucinated Compliance Claims in an API-Enabled LLM for Vendor Risk Reviews
Sequential Scaling
Learn After
Self-Consistency as a Minimum Bayes Risk Search Process
Framing Answer Selection as a Search Problem
An LLM generates five different step-by-step solutions to a complex algebra problem. A separate verification model then evaluates each solution by checking if the final answer is correct and if each intermediate step logically follows from the previous one. The solution with the highest score from the verifier is chosen as the final output. Match the components of this process, when framed as a search problem, to their correct descriptions.
Analyzing Code Generation as a Search Problem
Best-of-N Sampling
Best-of-N Sampling (Parallel Scaling)
Search Algorithm for Solution Selection