English

Enhancing Trust-Region Bayesian Optimization via Newton Methods

Machine Learning 2025-08-27 v1 Machine Learning

Abstract

Bayesian Optimization (BO) has been widely applied to optimize expensive black-box functions while retaining sample efficiency. However, scaling BO to high-dimensional spaces remains challenging. Existing literature proposes performing standard BO in multiple local trust regions (TuRBO) for heterogeneous modeling of the objective function and avoiding over-exploration. Despite its advantages, using local Gaussian Processes (GPs) reduces sampling efficiency compared to a global GP. To enhance sampling efficiency while preserving heterogeneous modeling, we propose to construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving the bound-constrained quadratic program. Additionally, we address the issue of vanishing gradients of GPs in high-dimensional spaces. We provide a convergence analysis and demonstrate through experimental results that our method enhances the efficacy of TuRBO and outperforms a wide range of high-dimensional BO techniques on synthetic functions and real-world applications.

Keywords

Cite

@article{arxiv.2508.18423,
  title  = {Enhancing Trust-Region Bayesian Optimization via Newton Methods},
  author = {Quanlin Chen and Yiyu Chen and Jing Huo and Tianyu Ding and Yang Gao and Yuetong Chen},
  journal= {arXiv preprint arXiv:2508.18423},
  year   = {2025}
}
R2 v1 2026-07-01T05:05:21.881Z