English
Related papers

Related papers: Theoretical foundation for CMA-ES from information…

200 papers

In this study, we consider a continuous min--max optimization problem $\min_{x \in \mathbb{X} \max_{y \in \mathbb{Y}}}f(x,y)$ whose objective function is a black-box. We propose a novel approach to minimize the worst-case objective function…

Neural and Evolutionary Computing · Computer Science 2023-03-29 Atsuhiro Miyagi , Yoshiki Miyauchi , Atsuo Maki , Kazuto Fukuchi , Jun Sakuma , Youhei Akimoto

The covariance matrix adaptation evolution strategy (CMA-ES) is a powerful optimization method for continuous black-box optimization problems. Several noise-handling methods have been proposed to bring out the optimization performance of…

Neural and Evolutionary Computing · Computer Science 2024-05-21 Kento Uchida , Kenta Nishihara , Shinichi Shirakawa

In many practical optimization problems, the derivatives of the functions to be optimized are unavailable or unreliable. Such optimization problems are solved using derivative-free optimization techniques. One of the state-of-the-art…

Neural and Evolutionary Computing · Computer Science 2018-05-30 Najeeb Khan

In the post-Moore era, main performance gains of black-box optimizers are increasingly depending on parallelism, especially for large-scale optimization (LSO). Here we propose to parallelize the well-established covariance matrix adaptation…

Neural and Evolutionary Computing · Computer Science 2024-10-14 Qiqi Duan , Chang Shao , Guochen Zhou , Minghan Zhang , Qi Zhao , Yuhui Shi

The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) has been the most successful Evolution Strategy at exploiting covariance information; it uses a form of Principle Component Analysis which, under certain conditions, is suggested…

Neural and Evolutionary Computing · Computer Science 2011-12-20 Ofer M. Shir , Jonathan Roslund , Darrell Whitley , Herschel Rabitz

The covariance matrix adaptation evolution strategy (CMA-ES) is one of the most successful methods for solving black-box continuous optimization problems. One practically useful aspect of the CMA-ES is that it can be used without…

Neural and Evolutionary Computing · Computer Science 2023-09-15 Masahiro Nomura , Youhei Akimoto , Isao Ono

Evolution Strategies (ES) are stochastic derivative-free optimization algorithms whose most prominent representative, the CMA-ES algorithm, is widely used to solve difficult numerical optimization problems. We provide the first rigorous…

Optimization and Control · Mathematics 2022-10-25 Cheikh Touré , Anne Auger , Nikolaus Hansen

This study modifies the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm for multi-modal optimization problems. The enhancements focus on addressing the challenges of multiple global minima, improving the algorithm's…

Neural and Evolutionary Computing · Computer Science 2024-07-02 Wathsala Karunarathne , Indu Bala , Dikshit Chauhan , Matthew Roughan , Lewis Mitchell

The covariance matrix adaptation evolution strategy (CMA-ES) is an efficient continuous black-box optimization method. The CMA-ES possesses many attractive features, including invariance properties and a well-tuned default hyperparameter…

Neural and Evolutionary Computing · Computer Science 2023-05-02 Yohei Watanabe , Kento Uchida , Ryoki Hamano , Shota Saito , Masahiro Nomura , Shinichi Shirakawa

In this paper, we propose an efficient approximated rank one update for covariance matrix adaptation evolution strategy (CMA-ES). It makes use of two evolution paths as simple as that of CMA-ES, while avoiding the computational matrix…

Neural and Evolutionary Computing · Computer Science 2017-10-24 Zhenhua Li , Qingfu Zhang

This paper proposes RCMAES, a novel variant of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for CEC benchmark optimization. RCMAES integrates a dimension-dependent nonlinear population-size reduction strategy with an…

Neural and Evolutionary Computing · Computer Science 2026-05-01 Khoirul Faiq Muzakka , Sören Möller , Martin Finsterbusch

Multimodal optimization requires both exploration and exploitation. Exploration identifies promising attraction basins, while exploitation finds the best solutions within these basins. The balance between exploration and exploitation can be…

Neural and Evolutionary Computing · Computer Science 2025-06-03 Chandula Fernando , Kushani De Silva

When dealing with a parametric statistical model, a Riemannian manifold can naturally appear by endowing the parameter space with the Fisher information metric. The geometry induced on the parameters by this metric is then referred to as…

Machine Learning · Statistics 2023-10-03 Florent Bouchard , Arnaud Breloy , Antoine Collas , Alexandre Renaux , Guillaume Ginolhac

Evolutionary optimization algorithms often face defects and limitations that complicate the evolution processes or even prevent them from reaching the global optimum. A notable constraint pertains to the considerable quantity of function…

Neural and Evolutionary Computing · Computer Science 2025-05-23 Farshid Farhadi Khouzani , Abdolreza Mirzaei , Paul La Plante , Laxmi Gewali

Rather than obtaining a single good solution for a given optimization problem, users often seek alternative design choices, because the best-found solution may perform poorly with respect to additional objectives or constraints that are…

Neural and Evolutionary Computing · Computer Science 2025-08-06 Maria Laura Santoni , Christoph Dürr , Carola Doerr , Mike Preuss , Elena Raponi

Discrete and mixed-variable optimization problems have appeared in several real-world applications. Most of the research on mixed-variable optimization considers a mixture of integer and continuous variables, and several integer handlings…

Optimization and Control · Mathematics 2024-08-26 Kento Uchida , Ryoki Hamano , Masahiro Nomura , Shota Saito , Shinichi Shirakawa

One of the most challenging types of ill-posedness in global optimization is the presence of insensitivity regions in design parameter space, so the identification of their shape will be crucial, if ill-posedness is irrecoverable. Such…

Neural and Evolutionary Computing · Computer Science 2019-05-20 Jakub Sawicki , Maciej Smołka , Marcin Łoś , Robert Schaefer

This paper deals with the identification of the flux for a system of conservation laws in the specific example of analytic chromatography. The fundamental equations of chromatographic process are highly non linear. The state-of-the-art…

Optimization and Control · Mathematics 2007-10-02 Mohamed Jebalia , Anne Auger , Marc Schoenauer , Francois James , Marie Postel

Water distribution system design is a challenging optimisation problem with a high number of search dimensions and constraints. In this way, Evolutionary Algorithms (EAs) have been widely applied to optimise WDS to minimise cost subject…

Neural and Evolutionary Computing · Computer Science 2019-09-12 Mehdi Neshat , Bradley Alexander , Angus Simpson

Evolution strategies (ESs) are zeroth-order stochastic black-box optimization heuristics invariant to monotonic transformations of the objective function. They evolve a multivariate normal distribution, from which candidate solutions are…

Numerical Analysis · Mathematics 2022-02-09 Youhei Akimoto , Anne Auger , Tobias Glasmachers , Daiki Morinaga