no. 16 · Tuesday 17 November 2026
A Direction Adaptation Evolution Strategy for Noisy Derivative-Free Optimization
Abstract
In noisy derivative-free optimization (DFO), methods based on the matrix adaptation evolution strategy (MAES) often mistakenly identify points with spuriously good function values, undermining selection and leading to unreliable search directions. To address this, we develop a novel direction adaptation evolution strategy (DAES) that targets the algorithmic phases prone to noise propagation, combining selected-population search with complexity analysis. Fixing the transformation matrix to the identity, DAES employs a structured direction-generation mechanism consisting of symmetric sampling, joint sorting–selection of noisy values, partitioning of all sampled directions into three ranked groups, and construction of a heuristic search direction. Along this direction, a noisy derivative-free sufficient descent condition with extrapolation is applied. Using a probabilistic angle condition preserved through our proposed framework, we obtain, to the best of our knowledge, the first high-probability evaluation-complexity bounds for a noisy MAES-type method across nonconvex, convex, and strongly convex objectives, under bounded noise. Finally, experiments on 230 BARON BCP problems across eight noise levels compare DAES with five DFO solvers, notably MADFO, showing greater robustness at intermediate-to-small budgets.
- comments
- 40 pages; 5 figures
- fields
- Optimization and Control