arXiv:2509. 21725v3 Announce Type: replace Abstract: A bilevel optimization problem consists of two optimization problems nested as an upper- and a lower-level problem, in which the optimality of the lower-level problem defines a constraint for the upper-level problem.
By Takuya Kanayama, Yuki Ito, Tomoyuki Tamura, Masayuki Karasuyama
arXiv:2610.01269v1 Announce Type: cross
Abstract: Bayesian Optimisation (BO) is a powerful framework for the optimisation of expensive black-box functions, but typically requires refitting a surrogat...
By Luca Geminiani, Nadja Klein
The paper introduces BO-pro-c, a Bayesian optimisation algorithm that employs a product-of-experts Gaussian process (GP-pro-c) as its surrogate model. GP-pro-c combines multiple local GP experts to improve uncertainty quantification, reduce computational cost, and preserve global correlations, addressing the cubic complexity of single global GP models. Experiments show that BO-pro-c achieves competitive optimisation performance with a 0.9% lower simple regret and a 39.4% reduction in computational overhead compared to a single‑global‑GP baseline.
By Yean Hoon Ong
The paper introduces Gradient-based Sample Selection Bayesian Optimization (GSSBO), a method that builds the Gaussian process surrogate on a strategically chosen subset of samples rather than the full dataset. By using gradient information to eliminate redundant points while keeping diversity and representativeness, GSSBO achieves sublinear regret bounds and reduces the cubic computational cost of standard BO. Experiments on synthetic and real-world tasks show that this approach maintains comparable optimization performance while significantly cutting GP fitting time and resource usage.
By Qiyu Wei, Haowei Wang, Zirui Cao, Songhao Wang, Richard Allmendinger, Mauricio A \'Alvarez
MF-SCBO is a new multi‑fidelity extension of Scalable Constrained Bayesian Optimization designed for high‑dimensional black‑box functions with black‑box constraints. It handles an arbitrary number of fidelity levels and non‑nested sampling, addressing gaps in existing methods. Experiments on standard benchmarks and challenging problems show that MF‑SCBO generally converges faster than both single‑fidelity SCBO and other multi‑fidelity approaches in high‑dimensional constrained settings.
By Lucas Palazzolo, Micka\"el Binois, La\"etitia Giraldi
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.
By Trevor Campbell, Jonathan H. Huggins, Kyurae Kim, Charles C. Margossian