Local Search
Local search is a family of optimization algorithms that iteratively improve a solution by making small, localized changes. Current research focuses on enhancing efficiency and effectiveness through techniques like incorporating linkage learning to understand variable interactions, developing specialized operators for specific problem types (e.g., integer quadratic programming, stable matching), and integrating local search with other methods such as evolutionary algorithms, Bayesian optimization, and deep reinforcement learning. These advancements are improving the ability to solve complex problems across diverse fields, including operations research, machine learning, and robotics, by finding high-quality solutions more efficiently than previously possible.
Papers
Can You Improve My Code? Optimizing Programs with Local Search
Fatemeh Abdollahi, Saqib Ameen, Matthew E. Taylor, Levi H. S. Lelis
Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies
Rubens O. Moraes, David S. Aleixo, Lucas N. Ferreira, Levi H. S. Lelis
Learning Interpretable Heuristics for WalkSAT
Yannet Interian, Sara Bernardini
A Graph Multi-separator Problem for Image Segmentation
Jannik Irmai, Shengxian Zhao, Jannik Presberger, Bjoern Andres
Representation-agnostic distance-driven perturbation for optimizing ill-conditioned problems
Kirill Antonov, Anna V. Kononova, Thomas Bäck, Niki van Stein
COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search
Shibal Ibrahim, Wenyu Chen, Hussein Hazimeh, Natalia Ponomareva, Zhe Zhao, Rahul Mazumder