Trajectory-Aware Best-Arm Identification for Local Search Allocation in Bayesian Optimization and Beyond
Not on the map. Why?
Abstract (arXiv)
Bayesian optimization (BO) is effective for expensive black-box optimization, but its performance often degrades on multimodal or high-dimensional problems. A promising remedy is to run multiple local search processes, such as trust region--based BO, and allocate evaluations to those with high potential. However, current best values do not always reflect the final performance of each process. We propose a trajectory-aware best-arm identification (BAI) framework that uses optimization history to guide this allocation. The proposed method extrapolates improvement trajectories, estimates final performance, and progressively eliminates low-potential candidates. For trust region--based BO, we theoretically show that the proposed BAI-guided allocation accelerates convergence to the global optimum under mild assumptions. Experiments on synthetic and real-world benchmarks demonstrate that our method improves BO on multimodal problems. We also show that the same mechanism can enhance other local or population-based optimizers, suggesting its potential as a general extension strategy for multimodal black-box optimization.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 43 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
16 of 43 references.
References · 16
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2020pymoo: Multi-objective Optimization in Pythoncited by 200
- 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 182
- 2021High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspacescited by 141
- 2019Learning with Good Feature Representations in Bandits and in RL with a Generative Modelcited by 127
- 2017Batched Large-scale Bayesian Optimization in High-dimensional Spacescited by 117
- 2024Vanilla Bayesian Optimization Performs Great in High Dimensionscited by 92
- 2019Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspacescited by 73
- 2021Gaussian Process Bandit Optimization with Few Batchescited by 57
- 2021Optimal Order Simple Regret for Gaussian Process Banditscited by 54
- 2020Efficient Automatic CASH via Rising Banditscited by 31
- 2023Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spacescited by 28
4 more
- 2020Approximation Theory Based Methods for RKHS Banditscited by 6
- 2023Best Arm Identification for Stochastic Rising Banditscited by 6
- 2024Regional Expected Improvement for Efficient Trust Region Selection in High-Dimensional Bayesian Optimizationcited by 4
- 2024BOIDS: High-dimensional Bayesian Optimization via Incumbent-guided Direction Lines and Subspace Embeddingscited by 4
Built on by
Not cited yet.