跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24251 · v1

Analysis of the (1+1)-EA-ES-Bilevel on Mixed Discrete-Continuous Optimization Problems with Interactions

首次提交 2026-11-18 19:28
版本更新 2026-11-18 19:28
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

Mixed discrete-continuous optimization problems can pose challenges -- especially for previous integrated approaches -- when interactions cause beneficial discrete changes to be rejected before sufficient continuous adjustment. We introduce ProximityOneMax as a simple benchmark with pairwise discrete-continuous interactions. On this function, we prove an exponential lower bound on the expected time for the (1+1)-EA-ES-Integrated to reach the target accuracy when initialized near a continuous optimum for a suboptimal discrete configuration with a sufficiently small step size. Experiments show frequent entries into such states from random initialization. We introduce the (1+1)-EA-ES-Bilevel, which uses an upper-level (1+1)-EA to optimize discrete variables and a lower-level (1+1)-ES to optimize continuous variables for each fixed discrete offspring before selection. For several interaction benchmarks and sufficiently small target values ε>0ε> 0 that require an optimal discrete configuration, using fixed continuous initialization and a suitable fixed budget per lower-level call, we prove that the expected number of fitness evaluations to reach objective value at most εε is Θ(nd⋅log⁡nd⋅nc⋅log⁡(R/ε))Θ(n_d \cdot \log n_d \cdot n_c \cdot \log(R/\sqrtε)), where ndn_d is the number of discrete variables, ncn_c is the number of continuous variables, and RR bounds the distances from the fixed continuous starting point to all relevant continuous optima for fixed discrete configurations.

作者备注:14 pages, 2 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 19:28 · 最新观测版本

Analysis of the (1+1)-EA-ES-Bilevel on Mixed Discrete-Continuous Optimization Problems with Interactions

Mixed discrete-continuous optimization problems can pose challenges -- especially for previous integrated approaches -- when interactions cause beneficial discrete changes to be rejected before sufficient continuous adjustment. We introduce ProximityOneMax as a simple benchmark with pairwise discrete-continuous interactions. On this function, we prove an exponential lower bound on the expected time for the (1+1)-EA-ES-Integrated to reach the target accuracy when initialized near a continuous optimum for a suboptimal discrete configuration with a sufficiently small step size. Experiments show frequent entries into such states from random initialization. We introduce the (1+1)-EA-ES-Bilevel, which uses an upper-level (1+1)-EA to optimize discrete variables and a lower-level (1+1)-ES to optimize continuous variables for each fixed discrete offspring before selection. For several interaction benchmarks and sufficiently small target values ε>0ε> 0 that require an optimal discrete configuration, using fixed continuous initialization and a suitable fixed budget per lower-level call, we prove that the expected number of fitness evaluations to reach objective value at most εε is Θ(nd⋅log⁡nd⋅nc⋅log⁡(R/ε))Θ(n_d \cdot \log n_d \cdot n_c \cdot \log(R/\sqrtε)), where ndn_d is the number of discrete variables, ncn_c is the number of continuous variables, and RR bounds the distances from the fixed continuous starting point to all relevant continuous optima for fixed discrete configurations.

查看此版本解读 →查看此版本原文 ↗