BOIDS: High-Dimensional Bayesian Optimization via Incumbent-Guided Direction Lines and Subspace Embeddings
Lam Ngo, Huong Ha, Jeffrey Chan, Hongyu Zhang
Abstract
When it comes to expensive black-box optimization problems, Bayesian Optimization (BO) is a well-known and powerful solution. Many real-world applications involve a large number of dimensions, hence scaling BO to high dimension is of much interest. However, state-of-the-art high-dimensional BO methods still suffer from the curse of dimensionality, highlighting the need for further improvements. In this work, we introduce BOIDS, a novel high-dimensional BO algorithm that guides optimization by a sequence of one-dimensional direction lines using a novel tailored line-based optimization procedure. To improve the efficiency, we also propose an adaptive selection technique to identify most optimal lines for each round of line-based optimization. Additionally, we incorporate a subspace embedding technique for better scaling to high-dimensional spaces. We further provide theoretical analysis of our proposed method to analyze its convergence property. Our extensive experimental results show that BOIDS outperforms state-of-the-art baselines on various synthetic and real-world benchmark problems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 513ee26d-951e-4cfe-950b-fbe4caa6f4c7Cited by top-tier papers1
Ask how each one uses itBuilds on8
- Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree SearchLinnan Wang, Rodrigo Fonseca, Yuandong TianNeurIPS 2020 · 163 citations
- Re-Examining Linear Embeddings for High-Dimensional Bayesian OptimizationBenjamin Letham, Roberto Calandra, Akshara Rai, Eytan BakshyNeurIPS 2020 · 152 citations
- Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman KernelsBin Xin Ru, Xingchen Wan, Xiaowen Dong, Michael A. OsborneICLR 2021 · 116 citations
- Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested SubspacesLeonard Papenmeier, Luigi Nardi, Matthias PoloczekNeurIPS 2022 · 76 citations
- PFNs4BO: In-Context Learning for Bayesian OptimizationSamuel Müller, Matthias Feurer, Noah Hollmann, Frank HutterICML 2023 · 71 citations
Related papers
- Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian OptimizationLei Song, Ke Xue, Xiaobin Huang, Chao QianNeurIPS 2022 · 57 citations
- Trading Convergence Rate with Computational Budget in High Dimensional Bayesian OptimizationHung Tran-The, Sunil Gupta, Santu Rana, Svetha VenkateshAAAI 2020 · 14 citations
- Posterior Inference with Diffusion Models for High-dimensional Black-box OptimizationTaeyoung Yun, Kiyoung Om, Jaewoo Lee, Sujin Yun et al.ICML 2025
- Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search SpacesHung Tran-The, Sunil Gupta, Santu Rana, Huong Ha et al.NeurIPS 2020 · 8 citations
- Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed SpacesLeonard Papenmeier, Luigi Nardi, Matthias PoloczekNeurIPS 2023 · 40 citations
