arXiv:2606. 00862v1 Announce Type: cross Abstract: Surrogate-assisted evolutionary algorithms (SAEAs) have been widely used for expensive black-box optimization problems.
By Xiao Jin, Yongxiong Wang, Haobo Liu, Yudong Du, Yukun Du
arXiv:2609.22329v1 Announce Type: cross
Abstract: Black-Box Optimization (BBO) is often applied in several engineering fields and can utilize an advancement of numerical measure- ments and simulation...
By Md Khadimul Islam Zim (Czech Academy of Sciences, Institute of Computer Science, Prague, Czech Republic), Martin Hole\v{n}a (Czech Academy of Sciences, Institute of Computer Science, Prague, Czech Republic)
tidyHEBO is a BoTorch-native Bayesian optimization tool that jointly applies Yeo-Johnson output warping to a Gaussian‑process surrogate, evaluates acquisition functions on the original objective scale, and conducts constrained cumulative Pareto search across multiple acquisition criteria. Using only default settings, it outperformed other methods on the Olympus benchmark and performed strongly on synthetic, Needle‑in‑a‑Haystack, and Bayesmark tasks, while adaptive batching offered a trade‑off between parallelization and optimization quality. These results position tidyHEBO as a robust, reproducible optimizer suitable for diverse practical problems, including scientific applications and hyperparameter tuning.
By L. A. Zhukov, E. V. Shaburova, D. V. Antonets
The paper evaluates the Tabular Prior-data Fitted Network (TabPFN) as a surrogate model in surrogate‑assisted evolutionary algorithms (SAEAs) for expensive optimization problems. Through extensive experiments in both offline and online settings across a range of problem types—including single‑objective, multi‑objective, constrained, combinatorial, mixed‑variable, and engineering tasks—the study finds that TabPFN’s effectiveness varies strongly with the problem characteristics. The authors conclude that TabPFN should be used selectively, with customized model management and algorithm design tailored to data availability, landscape complexity, and search‑space properties.
By Lu Han, Jin Wang, Yuchen Li, Haoran Gu, Shulei Liu, Ziyang Shi, Wenao Lu, Handing Wang
arXiv:2607. 08791v1 Announce Type: cross Abstract: Designing effective multi-objective Bayesian optimization (MOBO) algorithms requires balancing many interdependent design choices whose optimal configuration is problem-dependent and typically demands deep expertise.
By Georgios Laskaris, Reuben Brasher, Niki van Stein, Elena Raponi, Thomas B\"ack, Florian Neukart
arXiv:2609.14418v1 Announce Type: cross
Abstract: Dynamic multi-mode resource-constrained project scheduling requires decisions to be made under precedence constraints, limited resources, multiple ex...
By Yuan Tian, Yi Mei, Mengjie Zhang