Intermediate · Research
Hill climbing
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. An iterative optimization technique that moves towards better solutions until no further improvement is possible.
Technical Definition
An iterative optimization technique that moves towards better solutions until no further improvement is possible.
How it works
Hill climbing is a local search optimization algorithm that works by iteratively improving a candidate solution. It starts with an initial solution and repeatedly makes small changes to it, moving towards better solutions (like climbing a hill). The process stops when making any further change does not yield a better solution, meaning it has reached a peak, which might be a local or global optimum.
Related Concepts
- Algorithm — A finite, well-defined sequence of steps used to learn from data or solve a computational problem.
- Optimization — The mathematical process of finding parameter values that minimize a loss function.