CMA-ES中的采样:低数量的低差异点
Sampling in CMA-ES: Low Numbers of Low Discrepancy Points
AI总结:
本文研究CMA-ES中的采样策略,发现在搜索过程中使用少量固定的低差异点集(如128或32个点)即可优于默认均匀采样,并在BBOB基准上近似完整伪随机序列的性能,同时建立了点集的$L_2$差异与CMA-ES经验性能的明确关系。
摘要:
协方差矩阵自适应进化策略(CMA-ES)是去随机化进化策略中最成功的例子之一。然而,它仍然依赖于随机采样后代,这可以通过均匀分布进行,随后转换为所需的 Gaussian。先前的工作表明,用低差异采样器(例如 Halton 或 Sobol 序列)替换这种均匀采样可以在广泛的问题集上提高性能。我们表明,遍历小的、固定的低差异点集仍然可以比默认均匀分布表现得更好。此外,在整个搜索过程中仅使用 128 个点就足以在 BBOB 基准上紧密近似使用完整伪随机序列直到维度 40 的经验性能。对于较低的维度(低于 10),我们发现使用少至 32 个独特的低差异点表现得与均匀采样相似或更好。在 2D 中,我们有高度优化的低差异样本可用,我们证明使用这些点产生最高的经验性能,并且只需要 16 个样本就能改进均匀采样。总体而言,我们建立了所用点集的 $L_2$ 差异与 CMA-ES 的经验性能之间的明确关系。
英文摘要:
The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is one of the most successful examples of a derandomized evolution strategy. However, it still relies on randomly sampling offspring, which can be done via a uniform distribution and subsequently transforming into the required Gaussian. Previous work has shown that replacing this uniform sampling with a low-discrepancy sampler, such as Halton or Sobol sequences, can improve performance over a wide set of problems. We show that iterating through small, fixed sets of low-discrepancy points can still perform better than the default uniform distribution. Moreover, using only 128 points throughout the search is sufficient to closely approximate the empirical performance of using the complete pseudorandom sequence up to dimensionality 40 on the BBOB benchmark. For lower dimensionalities (below 10), we find that using as little as 32 unique low discrepancy points performs similar or better than uniform sampling. In 2D, for which we have highly optimized low discrepancy samples available, we demonstrate that using these points yields the highest empirical performance and requires only 16 samples to improve over uniform sampling. Overall, we establish a clear relation between the $L_2$ discrepancy of the used point set and the empirical performance of the CMA-ES.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。