Sign inSign in
ConceptAI & ML

Hill climbing

A local search algorithm that starts from a state and iteratively moves to the neighboring state with the highest objective value until no higher neighbor exists.
as Pieter Abbeel defines itUC BerkeleyThe wording closest to all 3 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

2

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    An iterative optimization algorithm that starts with an arbitrary state and repeatedly makes local improvements until no better neighbors can be found.
    • 13:30Machine Learning: Optimization and Neural Networks
  • Brian Yu

    Harvard University · Undergraduate

    A local search algorithm that continuously moves in the direction of increasing value to find a local maximum.
    • 5:41:34Harvard CS50’s Artificial Intelligence with Python – Full University Course

Lectures that assume it

2

Connections

14

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

2 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.