[Paper] Improved Runtime Bound for the $(μ+ 1)$ EA on BinVal

Source: arXiv - 2606.13344v1

Overview

We study the $(μ+1)$ EA on the Binary Value function BinVal. We show that it needs at most $O(μ\log μ\cdot n \log n)$ function evaluations to find the optimum when $μ= o(n/\log n)$. This substantially improves upon the recent upper bound of $O(μ^5 n \log(n/μ^4))$ by Krejca, Neumann and Witt. Our results hold for several mutation operators including standard bit mutation. In particular, our bound implies that the $(μ+1)$ EA is at most a factor $O(\log μ\cdot \log n)$ slower on BinVal than on OneMax.

Key Contributions

This paper presents research in the following areas:

• cs.NE

Methodology

Please refer to the full paper for detailed methodology.

Practical Implications

This research contributes to the advancement of cs.NE.

Authors

• Joris Belder
• Johannes Lengler
• Raghu Raman Ravi

Paper Information

• arXiv ID: 2606.13344v1
• Categories: cs.NE
• Published: June 11, 2026
• PDF: Download PDF