Rethinking Trust Region Bayesian Optimization in High Dimensions
Not on the map. Why?
Abstract (arXiv)
Trust Region Bayesian Optimization (TuRBO) is an effective strategy for alleviating the curse of dimensionality in high-dimensional black-box optimization. However, inappropriate lengthscale design can cause the local Gaussian process (GP) model within the trust region to degenerate, leading to suboptimal performance in high dimensions. In this work, we show that TuRBO's local GP may remain either excessively complex or overly simple as the dimension D and trust region side length L vary. To address this issue, we propose a straightforward variant, AdaScale-TuRBO, which scales the GP lengthscale with both the problem dimension and trust region size, thereby preserving kernel geometry and maintaining consistent prior complexity. Empirically, we show that AdaScale-TuRBO can robustly outperform standard TuRBO and other popular high-dimensional BO methods on synthetic benchmarks and real-world trajectory planning tasks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 49 references that are in the map. First posted on arXiv 24 Apr 2026.
Builds on
25 of 49 references.
References · 25
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 359
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
- 2021High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspacescited by 139
- 2015High Dimensional Bayesian Optimisation and Bandits via Additive Modelscited by 137
- 2017Batched Large-scale Bayesian Optimization in High-dimensional Spacescited by 116
- 2021Multi-Objective Bayesian Optimization over High-Dimensional Search Spacescited by 87
- 2024Vanilla Bayesian Optimization Performs Great in High Dimensionscited by 87
- 2020Scalable Constrained Bayesian Optimizationcited by 84
- 2021A survey on high-dimensional Gaussian process modeling with application to Bayesian optimizationcited by 76
- 2021Local policy search with Bayesian optimizationcited by 37
- 2022Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimizationcited by 37
- 2023Are Random Decompositions all we need in High Dimensional Bayesian Optimisation?cited by 35
13 more
- 2024Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimizationcited by 33
- 2022Local Bayesian optimization via maximizing probability of descentcited by 29
- 2025Understanding High-Dimensional Bayesian Optimizationcited by 19
- 2024Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimizationcited by 9
- 2025We Still Don't Understand High-Dimensional Bayesian Optimizationcited by 9
- 2025NeST-BO: Fast Local Bayesian Optimization via Newton-Step Targeting of Gradient and Hessian Informationcited by 6
- 2023High-dimensional Bayesian Optimization with Group Testingcited by 5
- 2026BayeSQP: Bayesian Optimization through Sequential Quadratic Programmingcited by 5
- 2024CAGES: Cost-Aware Gradient Entropy Search for Efficient Local Multi-Fidelity Bayesian Optimizationcited by 4
- 2024Regional Expected Improvement for Efficient Trust Region Selection in High-Dimensional Bayesian Optimizationcited by 3
- 2025Multi-Objective Bayesian Optimization for Networked Black-Box Systems: A Path to Greener Profits and Smarter Designscited by 3
- 2025Enhancing Trust-Region Bayesian Optimization via Newton Methodscited by 2
- 2025Local Entropy Search over Descent Sequences for Bayesian Optimizationcited by 1
Built on by
Not cited yet.