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.
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
2Each in their own terms, from the easiest level.
Pieter Abbeel
An iterative optimization algorithm that starts with an arbitrary state and repeatedly makes local improvements until no better neighbors can be found.Brian Yu
A local search algorithm that continuously moves in the direction of increasing value to find a local maximum.
Lectures that assume it
2Connections
14The lectures that define it or assume it, and the concepts next to it.