Learn Before
Concept

Step-Level Search as a Tree Search Problem

Step-level search with verifiers can be formulated as a tree search problem. In this framework, each state or node corresponds to a partial reasoning path, denoted as ai=(a1,...,ai)\mathbf{a}_{\le i} = (a_1, ..., a_i), which represents the sequence of ii reasoning steps taken so far. The search process explores the state space starting from an initial empty path to find a complete path that forms a correct solution. The notation ai\mathbf{a}_{\le i} is used to highlight the focus on individual actions or steps, distinguishing it from the notation yi\mathbf{y}_{\le i} or y\mathbf{y}, which is typically used for full paths or complete solutions in solution-level search.

0

1

Updated 2026-05-06

Contributors are:

Who are from:

Tags

Ch.5 Inference - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences