A Novel Evolution Strategy with Directional Gaussian Smoothing for Blackbox Optimization
Not on the map. Why?
Abstract (arXiv)
We propose an improved evolution strategy (ES) using a novel nonlocal gradient operator for high-dimensional black-box optimization. Standard ES methods with d-dimensional Gaussian smoothing suffer from the curse of dimensionality due to the high variance of Monte Carlo (MC) based gradient estimators. To control the variance, Gaussian smoothing is usually limited in a small region, so existing ES methods lack nonlocal exploration ability required for escaping from local minima. We develop a nonlocal gradient operator with directional Gaussian smoothing (DGS) to address this challenge. The DGS conducts 1D nonlocal explorations along d orthogonal directions in ℝd, each of which defines a nonlocal directional derivative as a 1D integral. We then use Gauss-Hermite quadrature, instead of MC sampling, to estimate the d 1D integrals to ensure high accuracy (i.e., small variance). Our method enables effective nonlocal exploration to facilitate the global search in high-dimensional optimization. We demonstrate the superior performance of our method in three sets of examples, including benchmark functions for global optimization, and real-world science and engineering applications.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 2; 2024: 1.
6 papers.
- 2021Deep Reinforcement Learning Versus Evolution Strategies: A Comparative Surveycited by 23
- 2021A Scalable Gradient-Free Method for Bayesian Experimental Design with Implicit Modelscited by 7
- 2023Zero Grads: Learning Local Surrogate Losses for Non-Differentiable Graphicscited by 5
- 2023Policy Gradient Algorithms Implicitly Optimize by Continuationcited by 4
- 2024Data-Centric Approach to Constrained Machine Learning: A Case Study on Conway's Game of Lifecited by 2
- 2021A Hybrid Gradient Method to Designing Bayesian Experiments for Implicit Modelscited by 0
- 2024Data-Centric Approach to Constrained Machine Learning: A Case Study on Conway's Game of Life23 Aug 2024
- 2023Zero Grads: Learning Local Surrogate Losses for Non-Differentiable Graphics10 Aug 2023
- 2023Policy Gradient Algorithms Implicitly Optimize by Continuation11 May 2023
- 2021Deep Reinforcement Learning Versus Evolution Strategies: A Comparative Survey28 Sep 2021
- 2021A Hybrid Gradient Method to Designing Bayesian Experiments for Implicit Models14 Mar 2021
- 2021A Scalable Gradient-Free Method for Bayesian Experimental Design with Implicit Models14 Mar 2021