Concept

Node Representation in Step-Level Tree Search

In the tree search model for step-level verification, a node is defined as a partial reasoning path, denoted by the sequence ai=(a1,...,ai)\mathbf{a}_{\le i} = (a_1, ..., a_i). This represents the series of reasoning steps taken from the beginning of the problem-solving process.

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

Related