Skip to content

Enhancing evolution strategy with stratified sampling: A study on sample efficiency and convergence speed

Aug 2026 · International Journal of Computational Methods · 0 citations

TL;DR

The stratified sampling technique based on the Latin hypercube sampling (LHS) mechanism is added to speed up the convergence speed to the global optimum and significantly improves the sample efficiency and convergence speed.

Abstract

Evolution strategy (ES) is a widely recognized evolutionary computation technique employed to address optimization challenges. Typically, ES generates candidate solutions by drawing from a multivariate normal distribution. However, due to the randomness of sampling, several samples are clustered together during every iteration, which may lead to lower accuracy and slower convergence in optimization problems. In this study, the stratified sampling technique based on the Latin hypercube sampling (LHS) mechanism is added to speed up the convergence speed to the global optimum. These sample vectors are combined to obtain the sample matrix of ES with population size, which enables the algorithm to improve the sample efficiency. Furthermore, several standard unimodal and multimodal functions are tested to evaluate the performance of the sampling strategy on covariance matrix adaptation evolution strategy (CMA-ES) with LHS and optimized LHS (OLHS) on convergence speed, search precision, and dimension scalability. Compared with the CMA-ES with random sampling, the proposed CMA-ES-OLHS achieves an average reduction of 21.8~26.5% in function evaluations across 11 benchmark functions, demonstrating that OLHS significantly improves the sample efficiency and convergence speed.

View source

Similar papers

Open access Sep 2026

A two-stage pareto selection strategy with compromise programming for the DIRECT algorithm

A novel DIRECT-type algorithm employing a parameterized Pareto approach is proposed for box-constrained optimization problems. The method features a two-stage Pareto selection process. The first stage focuses on global exploration, using a parameter to identify the smallest significant hyperrectangle, which helps avoid...

Mira Mustika, Salmah Salmah, Indarsih Indarsih · 0 citations
Open access Sep 2026

A Hybrid CMA-ES–GWO Algorithm for Solving Optimization Problems

Experimental results demonstrate that the proposed hybrid strategy effectively overcomes the individual limitations of CMA-ES and GWO, making HCG a reliable method for solving complex continuous optimization problems.

Elias Ahmad Ahmadi, Besmillah Danish, Ahmad Ramin Rahnaward · 0 citations
Open access Aug 2026

A general hybrid framework for many-objective optimization: integrating local search into reference-vector-based evolutionary algorithms

Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...

Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al. · 0 citations
Open access Aug 2026

Performance of multi-strategy optimized mayfly optimization algorithm for location selection of university reimbursement form submission terminals

A multi-strategy optimized mayfly optimization algorithm (MSMOA) is proposed to improve the overall optimization performance of MOA and achieves the best overall average rank among the compared algorithms and maintained competitive performance across high-dimensional settings.

Ze Yang, Jing-Jun Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.