Sign inSign in
ConceptAI & ML

Beam search

A heuristic search algorithm that explores a graph by expanding the most promising nodes in a limited set.
as Sara Beery defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Patrick Winston

    MIT · Undergraduate

    A heuristic search algorithm that explores a graph by expanding the most promising nodes in a limited set.
    • 18:50Learning: Near Misses and Felicity Conditions in AI
    • 31:40Search: Depth-First, Hill Climbing, Beam Search
  • Phillip Isola

    MIT · Graduate

    A tree search generation method that maintains the top-k best candidate sequences at each step.
    • 29:32Inference Methods for Deep Learning

Lectures that assume it

1

Connections

12

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.