arXiv Machine Learning By Lu Han, Jin Wang, Yuchen Li, Haoran Gu, Shulei Liu, Ziyang Shi, Wenao Lu, Handing Wang

Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 23

Artificial Neural Networks as Surrogate Models in Black Box Optimization

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)
arXiv AI
Sep 10

An Evolutionary Framework for Automatic Optimization Benchmark Generation via Large Language Models

The paper introduces LLM-EBG, an evolutionary framework that uses a large language model as a generative operator to automatically create optimization benchmarks. By generating unconstrained single-objective continuous minimization problems expressed as mathematical formulas, the framework can produce benchmarks that consistently favor a target algorithm over a comparison algorithm in over 80% of trials. Landscape analysis shows that these generated problems exhibit distinct geometric traits, such as sensitivity to variable scaling, reflecting the search behaviors of different optimization methods.

By Yuhiro Ono, Tomohiro Harada, Yukiya Miura