Sign inSign in
ConceptSystems & CS

Simulated annealing

A probabilistic local search technique that allows moves to worse states with a probability that decreases over time, mimicking the physical annealing process to escape local optima.
as Brian Yu defines itHarvard UniversityThe wording closest to all 5 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

4

Each in their own terms, from the easiest level.

  • Patrick Winston

    MIT · Undergraduate

    A process where you start with a big step size and gradually reduce it, analogous to letting a metal cool down, to crawl up to local maxima.
    • 25:57Genetic Algorithms: MIT Artificial Intelligence
  • Pieter Abbeel

    UC Berkeley · Undergraduate

    A local search variant that occasionally allows downhill moves with a probability dependent on the step quality and a decreasing temperature parameter.
    • 1:15:39Constraint Satisfaction Problems (CSPs) Part 2/2
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    An optimization technique that starts with a heuristic-only query plan and computes random permutations of operators while accepting cost-increasing changes with some probability.
    • 52:02Query Optimizer Implementation 2
    • 55:29Join Ordering: Bottom-up

Connections

10

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

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