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.
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.
Cost model2Hill climbing2Probability2Heuristic query optimization1Local maximum1Local optima1Randomized algorithm1Step size1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Patrick Winston
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.Pieter Abbeel
A local search variant that occasionally allows downhill moves with a probability dependent on the step quality and a decreasing temperature parameter.Andy Pavlo
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.
Connections
10The lectures that define it or assume it, and the concepts next to it.