arXiv · 2310.00745
Deterministic Langevin Unconstrained Optimization with Normalizing Flows
Abstract
We introduce a global, gradient-free surrogate optimization strategy for expensive black-box functions inspired by the Fokker-Planck and Langevin equations. These can be written as an optimization problem where the objective is the target function to maximize minus the logarithm of the current density of evaluated samples. This objective balances exploitation of the target objective with exploration of low-density regions. The method, Deterministic Langevin Optimization (DLO), relies on a Normalizing Flow density estimate to perform active learning and select proposal points for evaluation. This strategy differs qualitatively from the widely-used acquisition functions employed by Bayesian Optimization methods, and can accommodate a range of surrogate choices. We demonstrate superior or competitive progress toward objective optima on standard synthetic test functions, as well as on non-convex and multi-modal posteriors of moderate dimension. On real-world objectives, such as scientific and neural network hyperparameter optimization, DLO is competitive with state-of-the-art baselines.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
James M. Sullivan, Uros Seljak. 2023-10-01. Deterministic Langevin Unconstrained Optimization with Normalizing Flows. https://arxiv.org/abs/2310.00745
Cite the original work for its findings. Save a collection to share your selection of sources.