arXiv AI By Hari Mohan Pandey

Coronavirus Optimization Algorithm: A Success-History Adaptive Evolutionary Framework with Archive-Assisted Search and Stagnation Recovery for Global Optimization

Read the original on arXiv AI →

The paper introduces the Coronavirus Optimization Algorithm (COA), a SARS‑CoV‑2 inspired evolutionary optimizer for box‑constrained continuous global optimization. COA maps coronavirus mechanisms to search operators such as elite‑guided attraction, trial‑vector generation, adaptive parameter variation, stagnation recovery, and population‑size scheduling, and incorporates opposition‑based initialization, current‑to‑pbest mutation, binomial crossover, an external archive, success‑history adaptation, population reduction, and partial restart. Evaluated on 29 CEC 2017 benchmark functions at 10, 30, and 50 dimensions, COA achieves the best overall Friedman rank across all dimensions, excelling particularly on composition functions while noting limitations on some hybrid functions and the need for further high‑dimensional validation.

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 AI.

arXiv Machine Learning
Sep 17

Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization

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 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