English

Deterministic Langevin Unconstrained Optimization with Normalizing Flows

Machine Learning 2023-10-03 v1 Optimization and Control

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.

Keywords

Cite

@article{arxiv.2310.00745,
  title  = {Deterministic Langevin Unconstrained Optimization with Normalizing Flows},
  author = {James M. Sullivan and Uros Seljak},
  journal= {arXiv preprint arXiv:2310.00745},
  year   = {2023}
}

Comments

31 pages, 9 figures, 1 table, submitted to JOGO

R2 v1 2026-06-28T12:37:38.996Z