Metraipolis › archive › dc_2ae1749d18cc

ILP-BO: Integer Linear Programming-Based Black-Box Optimization — arXiv:2609.33131

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33131
License (as archived)
CC0-1.0
Archived
2026-10-07T22:37:12.271Z
SHA-256 of the archived text
65d9d154daf4340865d309fcc4a4dc2f15fb0aa12cefb0f20eeef90872cdf23e
Stable URL of this page
https://metraipolis.com/documento/dc_2ae1749d18cc

How to cite

ILP-BO: Integer Linear Programming-Based Black-Box Optimization — arXiv:2609.33131 — arXiv (en), https://arxiv.org/abs/2609.33131 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ae1749d18cc (Metraipolis archive dc_2ae1749d18cc, sha256 65d9d154daf4340865d309fcc4a4dc2f15fb0aa12cefb0f20eeef90872cdf23e)
BibTeX
@misc{dc2ae1749d18cc,
  title = {ILP-BO: Integer Linear Programming-Based Black-Box Optimization — arXiv:2609.33131},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33131},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ae1749d18cc; sha256 65d9d154daf4340865d309fcc4a4dc2f15fb0aa12cefb0f20eeef90872cdf23e},
  year = {2026}
}

Archived text

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

Black-box Optimization (BO) is a powerful framework for optimizing expensive objective functions or unknown functions with a limited number of evaluations. A central step of standard BO such as Bayesian optimization is the optimization of a surrogate-based acquisition criterion, which is commonly performed using nonlinear optimization or heuristic search. Therefore, conventional black-box optimization generally does not guarantee global optimality in candidate selection. In this study, we propose Integer Linear Programming-based Black-box Optimization (ILP-BO), a quasi-Bayesian optimization framework that transforms kernel-based surrogate optimization over discrete domains into an Integer Linear Programming (ILP) problem. The key idea is to represent nonlinear kernel functions exactly on finite discrete distance levels by introducing binary one-hot auxiliary variables. This transformation converts the nonlinear surrogate into a linear objective with linear constraints and binary variables. To incorporate exploration while preserving the linear structure, we further introduce a Hamming-distance margin that excludes neighborhoods around previously observed points. We derive the proposed formulation for several standard kernels and obtain an analytical upper bound on the Hamming-distance threshold based on the measure in the binary search space. The resulting candidate-selection problem can be solved by integer programming solvers with certificates of optimality. Thus, our methodology has the potential to serve as a highly transparent black-box optimization framework. Experiments on synthetic and discrete optimization benchmarks show that ILP-BO achieves competitive optimization performance compared with practical Bayesian optimization methods.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.33131 — 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-07T22:14:27.874Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).