arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.16757cs.NE
收藏

加性噪声下进化策略的自适应重评估方法

An Adaptive Re-evaluation Method for Evolution Strategy under Additive Noise

Catalin-Viorel Dinu, Yash J. Patel, Xavier Bonet-Monroig, Hao Wang

AI总结:

本文针对CMA-ES在加性高斯白噪声下的优化问题,提出一种基于期望改进下界最大化的自适应最优重评估次数选择方法,并在多噪声水平、预算和维度实验中验证其显著提升命中近最优值的概率。

摘要:

协方差矩阵自适应进化策略(CMA-ES)是数值黑盒优化中最先进的算法之一。对于含噪目标函数,已有多种方法被提出以减轻噪声影响,例如对同一解进行重评估或调整种群规模。本文设计了一种新方法,用于在函数值受到加性高斯白噪声污染时自适应选择最优重评估次数。在给定噪声水平和函数梯度Lipschitz常数估计的前提下,我们推导了CMA-ES单次迭代所获得的期望改进的理论下界。通过求解该下界的最大值,我们得到了最优重评估次数的简洁表达式。我们在一组人工测试函数上,跨越不同噪声水平、优化预算和维度,将本文方法与针对CMA-ES的最先进噪声处理方法进行了实验比较。结果表明,本文方法在命中近最优函数值的概率方面具有显著优势。

英文摘要:

The Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) is one of the most advanced algorithms in numerical black-box optimization. For noisy objective functions, several approaches were proposed to mitigate the noise, e.g., re-evaluations of the same solution or adapting the population size. In this paper, we devise a novel method to adaptively choose the optimal re-evaluation number for function values corrupted by additive Gaussian white noise. We derive a theoretical lower bound of the expected improvement achieved in one iteration of CMA-ES, given an estimation of the noise level and the Lipschitz constant of the function's gradient. Solving for the maximum of the lower bound, we obtain a simple expression of the optimal re-evaluation number. We experimentally compare our method to the state-of-the-art noise-handling methods for CMA-ES on a set of artificial test functions across various noise levels, optimization budgets, and dimensionality. Our method demonstrates significant advantages in terms of the probability of hitting near-optimal function values.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑