Natural Variational Annealing for Multimodal Optimization
Tâm LeMinh, Julyan Arbel, Thomas Möllenhoff, Mohammad Emtiyaz Khan, Florence Forbes
TL;DR
Natural Variational Annealing (NVA) offers a principled multimodal optimization framework by marrying variational approximations (via mixture search distributions), entropy-regularized annealing, and natural-gradient learning. It enables simultaneous exploration of multiple basins and progressively concentrates on high-value regions through a tempered objective, with variants for Gaussian mixtures (NVA-GM) and fitness shaping (FS-NVA-GM). Theoretical results show annealing concentrates the search on global modes and that Gaussian mixtures track modes as ω→0, while simulations and a planetary-inverse problem demonstrate robust mode-finding and practical applicability. Overall, the framework provides a flexible, tunable approach with clear trade-offs between exploration, convergence, and computational cost, and points to promising directions for scalability and adaptive scheduling.
Abstract
We introduce a new multimodal optimization approach called Natural Variational Annealing (NVA) that combines the strengths of three foundational concepts to simultaneously search for multiple global and local modes of black-box nonconvex objectives. First, it implements a simultaneous search by using variational posteriors, such as, mixtures of Gaussians. Second, it applies annealing to gradually trade off exploration for exploitation. Finally, it learns the variational search distribution using natural-gradient learning where updates resemble well-known and easy-to-implement algorithms. The three concepts come together in NVA giving rise to new algorithms and also allowing us to incorporate "fitness shaping", a core concept from evolutionary algorithms. We assess the quality of search on simulations and compare them to methods using gradient descent and evolution strategies. We also provide an application to a real-world inverse problem in planetary science.
