Combining Bayesian Optimization and Lipschitz Optimization
Mohamed Osama Ahmed, Sharan Vaswani, Mark Schmidt

TL;DR
This paper introduces Lipschitz Bayesian optimization (LBO), a novel method combining Bayesian and Lipschitz optimization techniques to improve global black-box function optimization without increasing runtime.
Contribution
It proposes integrating Lipschitz continuity assumptions into Bayesian optimization algorithms, providing theoretical guarantees and demonstrating improved empirical performance on multiple datasets.
Findings
LBO performs similarly to standard BO in worst-case scenarios.
LBO significantly improves performance with Thompson sampling.
Estimating the Lipschitz constant dynamically is effective.
Abstract
Bayesian optimization and Lipschitz optimization have developed alternative techniques for optimizing black-box functions. They each exploit a different form of prior about the function. In this work, we explore strategies to combine these techniques for better global optimization. In particular, we propose ways to use the Lipschitz continuity assumption within traditional BO algorithms, which we call Lipschitz Bayesian optimization (LBO). This approach does not increase the asymptotic runtime and in some cases drastically improves the performance (while in the worst-case the performance is similar). Indeed, in a particular setting, we prove that using the Lipschitz information yields the same or a better bound on the regret compared to using Bayesian optimization on its own. Moreover, we propose a simple heuristics to estimate the Lipschitz constant, and prove that a growing estimate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
