Natural variational annealing for multimodal optimization

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 non-convex 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.