Efficient Minimax Optimal Global Optimization of Lipschitz Continuous Multivariate Functions

06/06/2022
by   Kaan Gokcesu, et al.
0

In this work, we propose an efficient minimax optimal global optimization algorithm for multivariate Lipschitz continuous functions. To evaluate the performance of our approach, we utilize the average regret instead of the traditional simple regret, which, as we show, is not suitable for use in the multivariate non-convex optimization because of the inherent hardness of the problem itself. Since we study the average regret of the algorithm, our results directly imply a bound for the simple regret as well. Instead of constructing lower bounding proxy functions, our method utilizes a predetermined query creation rule, which makes it computationally superior to the Piyavskii-Shubert variants. We show that our algorithm achieves an average regret bound of O(L√(n)T^-1/n) for the optimization of an n-dimensional L-Lipschitz continuous objective in a time horizon T, which we show to be minimax optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2023

Efficient Lipschitzian Global Optimization of Hölder Continuous Multivariate Functions

This study presents an effective global optimization technique designed ...
research
09/06/2022

1D to nD: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers

In this work, we propose a meta algorithm that can solve a multivariate ...
research
08/24/2021

Regret Analysis of Global Optimization in Univariate Functions with Lipschitz Derivatives

In this work, we study the problem of global optimization in univariate ...
research
02/06/2020

Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization

We consider the problem of maximizing a non-concave Lipschitz multivaria...
research
01/18/2022

Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functions

In this work, we propose a computationally efficient algorithm for the p...
research
03/07/2017

Global optimization of Lipschitz functions

The goal of the paper is to design sequential strategies which lead to e...
research
07/22/2019

Online optimization of piecewise Lipschitz functions in changing environments

In an online optimization problem we are required to choose a sequence o...

Please sign up or login with your details

Forgot password? Click here to reset