Extremal Optimization: an Evolutionary Local-Search Algorithm
Stefan Boettcher (Emory U), Allon G. Percus (Los Alamos)

TL;DR
Extremal Optimization is a heuristic inspired by self-organized criticality that effectively explores complex solution spaces in hard optimization problems without parameter tuning.
Contribution
This paper introduces extremal optimization, a novel local-search algorithm inspired by non-equilibrium phenomena, demonstrating its effectiveness on large-scale constrained problems.
Findings
Outperforms traditional heuristics on large test problems
Scales efficiently with problem size up to 10^5 variables
Parameter prediction aligns with experimental results
Abstract
A recently introduced general-purpose heuristic for finding high-quality solutions for many hard optimization problems is reviewed. The method is inspired by recent progress in understanding far-from-equilibrium phenomena in terms of {\em self-organized criticality,} a concept introduced to describe emergent complexity in physical systems. This method, called {\em extremal optimization,} successively replaces the value of extremely undesirable variables in a sub-optimal solution with new, random ones. Large, avalanche-like fluctuations in the cost function self-organize from this dynamics, effectively scaling barriers to explore local optima in distant neighborhoods of the configuration space while eliminating the need to tune parameters. Drawing upon models used to simulate the dynamics of granular media, evolution, or geology, extremal optimization complements approximation methods…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
