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