Search Space
Search space optimization focuses on efficiently exploring and exploiting the vast number of possible configurations within a given problem domain, aiming to identify optimal or near-optimal solutions. Current research emphasizes developing more efficient search algorithms, including gradient-based methods, Bayesian optimization, evolutionary strategies, and reinforcement learning, often applied within hierarchical or modular search spaces to manage complexity. These advancements are crucial for accelerating progress in diverse fields like neural architecture search, robotics, and materials science, where the sheer size of the search space presents a major computational bottleneck. Improved search space exploration promises to unlock more efficient and effective solutions across numerous scientific and engineering disciplines.
Papers
Predicting the utility of search spaces for black-box optimization: a simple, budget-aware approach
Setareh Ariafar, Justin Gilmer, Zachary Nado, Jasper Snoek, Rodolphe Jenatton, George E. Dahl
Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems
Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li