Formula

Formula for a Candidate Solution Set

A search algorithm can efficiently explore the space of possible output sequences to generate a set of candidate solutions. This set of candidate solutions is formally represented as Dc={y1,...,yK}\mathcal{D}_c = \{\mathbf{y}_1, ..., \mathbf{y}_K\}, where each y\mathbf{y} represents an individual candidate solution.

Image 0

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