Concept

Computational Cost of Beam Search in Sequence-to-Sequence Models

The computational cost of generating a sequence using beam search is bounded by \mathcal{O}(k\left|\mathcal{Y} ight|T'), where kk represents the beam size, \left|\mathcal{Y} ight| is the size of the output vocabulary, and TT' is the maximum length of the generated sequence. This measurable cost situates beam search as an intermediate strategy, rendering it more computationally intensive than greedy search but considerably more tractable than exhaustive search.

0

1

Updated 2026-05-14

Contributors are:

Who are from:

Tags

D2L

Dive into Deep Learning @ D2L

Related