Convergence Analysis of Evolution Strategies for Mixed-Integer Optimization
Ryoki Hamano, Kento Uchida, Shinichi Shirakawa

TL;DR
This paper provides a theoretical convergence analysis of evolution strategies for mixed-integer optimization, highlighting how different bounds on integer variables affect convergence speed and reliability.
Contribution
It introduces and analyzes two (1+1)-ES variants for mixed-integer domains, offering insights into their convergence behavior and guiding better algorithm design.
Findings
(1+1)-LB-ES can suffer from premature convergence with many integer variables.
(1+1)-LUB-ES achieves linear convergence under proper parameters.
The analysis offers theoretical understanding of integer handling impacts on ES convergence.
Abstract
Mixed-integer extensions of evolution strategies (ES) that discretize selected coordinates of sampled continuous vectors often impose a lower bound on the standard deviation of integer variables to prevent premature convergence. While these methods show promising empirical results, this handling can slow the convergence of continuous variables, and its impact has lacked a clear theoretical account. In this paper, we provide a convergence analysis of evolution strategies for mixed-integer optimization, inspired by the drift analysis of the (1+1)-ES in the continuous domain. Specifically, we consider two (1+1)-ES variants for mixed-integer domains: (1+1)-LB-ES, which introduces a lower bound on the standard deviation for integer variables, and (1+1)-LUB-ES, which combines both lower and upper bounds to enhance the convergence of the continuous variables. Focusing on the optimization phase…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
