Metraipolis › archive › dc_58a6bc599eb0

Exploiting Separability in Multi-Scale Grey-Box Bayesian Optimization — arXiv:2608.03045

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03045
License (as archived)
CC0-1.0
Archived
2026-10-31T12:42:20.578Z
SHA-256 of the archived text
d6dfbe70156e3cc3ddb874dad76cc4879fa511d6ea13d1957084fd0c2da5ec03
Stable URL of this page
https://metraipolis.com/documento/dc_58a6bc599eb0

How to cite

Exploiting Separability in Multi-Scale Grey-Box Bayesian Optimization — arXiv:2608.03045 — arXiv (en), https://arxiv.org/abs/2608.03045 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_58a6bc599eb0 (Metraipolis archive dc_58a6bc599eb0, sha256 d6dfbe70156e3cc3ddb874dad76cc4879fa511d6ea13d1957084fd0c2da5ec03)
BibTeX
@misc{dc58a6bc599eb0,
  title = {Exploiting Separability in Multi-Scale Grey-Box Bayesian Optimization — arXiv:2608.03045},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03045},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_58a6bc599eb0; sha256 d6dfbe70156e3cc3ddb874dad76cc4879fa511d6ea13d1957084fd0c2da5ec03},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03045. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider grey-box optimization problems where the decision variables naturally partition into black-box variables (as arguments to an expensive black-box function) and white-box variables, governed by a set of explicit, closed-form equations that also depend on the output of the black-box function. We exploit this separability through a bilevel reformulation: an outer Bayesian optimization (BO) to optimize the scalar objective as a function of black-box variables alone, while an inner problem solves the white-box subproblem via global optimization. The Gaussian process surrogate used in BO is therefore defined rather than and white-box constraints are satisfied exactly whenever the inner optimizer converges to a feasible point---without penalty functions, chance constraints, or moment approximations. On a suite of 13 benchmark problems, bilevel BO achieves lower regret, with fewer iterations and wall clock time. This advantage is robust to initialization set size, exploration parameters, and inner-solver choice.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.03045 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:31:30.337Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).