$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 global optimization problem using univariate global optimizers. Although the univariate global optimization does not receive much attention compared to the multivariate case, which is more emphasized in academia and industry; we show that it is still relevant and can be directly used to solve problems of multivariate optimization. We also provide the corresponding regret bounds in terms of the time horizon $T$ and the average regret of the univariate optimizer, when it is robust against nonnegative noises with robust regret guarantees.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationSimilar Papers 제목 키워드 기반
A Granular Sieving Algorithm for Deterministic Global Optimization
A gradient-free deterministic method is developed to solve global optimization problems for Lipschitz continuous functions defined in arbitrary path-wise connected compact sets in Euclidean spaces. The method can be rega…
global-optimizationMultivariate Comparison of Classification Algorithms
Statistical tests that compare classification algorithms are univariate and use a single performance measure, e.g., misclassification error, $F$ measure, AUC, and so on. In multivariate tests, comparison is done using mu…
ClassificationGeneral ClassificationSymbolic Metamodels for Interpreting Black-boxes Using Primitive Functions
One approach for interpreting black-box machine learning models is to find a global approximation of the model using simple interpretable functions, which is called a metamodel (a model of the model). Approximating the b…
Feature ImportanceFormSymbolic RegressionPartial-Multivariate Model for Forecasting
When solving forecasting problems including multiple time-series features, existing approaches often fall into two extreme categories, depending on whether to utilize inter-feature information: univariate and complete-mu…
modelInterpreting Black-boxes Using Primitive Parameterized Functions
One approach for interpreting black-box machine learning models is to find a global approximation of the model using simple interpretable functions, which is called a metamodel (a model of the model). Approximating the b…
Feature ImportanceFormSymbolic Regression