1D to nD: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 51 references that are in the map. First posted on arXiv 6 Sep 2022.
Builds on
13 of 51 references.
References · 13
- 2021Convex optimizationcited by 2,515
- 2014Convex Optimization: Algorithms and Complexitycited by 575
- 2017Non-convex Optimization for Machine Learningcited by 133
- 2017Global optimization of Lipschitz functionscited by 39
- 2021Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statisticscited by 32
- 2018A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumptioncited by 23
- 2018Sequential Outlier Detection based on Incremental Decision Treescited by 21
- 2021Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Errorcited by 17
- 2020Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environmentscited by 15
- 2019Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Playscited by 11
- 2020Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimizationcited by 11
- 2022Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functionscited by 11
Built on by
Not cited yet.