Sign inSign in
ConceptSystems & CS

Random-restart hill climbing

A technique that repeatedly runs hill climbing from random initial states and then selects the best outcome among all runs.
as Brian Yu defines itHarvard University
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.

Hill climbing1Hill climbing algorithm1Local maxima and minima1Local optima1

Lecturers

1

    Connections

    2

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

    1 lecturer. 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.