基于比较的搜索中显式平均与新型符号平均的理论分析
Theoretical Analysis of Explicit Averaging and Novel Sign Averaging in Comparison-Based Search
AI总结:
本文针对黑盒优化中无有限均值噪声破坏排序的问题,提出符号平均方法,并从理论和实验上证明其能高概率估计中位数顺序,优于传统显式平均。
摘要:
在黑盒优化中,目标函数中的噪声不可避免。噪声会扰乱基于比较的优化中候选解的排序,可能导致搜索性能相比无噪声场景出现退化。显式平均(explicit averaging)对含噪声的目标函数值取样本平均,作为一种简单且通用的噪声处理技术被广泛使用。尽管它适用于多种应用,但当均值非有限时,该方法会失效。我们从理论上揭示:在假设噪声服从无有限均值的稳定分布时,显式平均对真实排序的估计会产生负面影响。作为替代方案,本文提出符号平均(sign averaging),它是一种简单但鲁棒的噪声处理技术。我们从理论上证明,随着样本数量增加,符号平均能够以任意高的概率估计一对点的含噪声目标函数值的中位数顺序。其相对于显式平均的优势以及鲁棒性也通过数值实验得到了验证。
英文摘要:
In black-box optimization, noise in the objective function is inevitable. Noise disrupts the ranking of candidate solutions in comparison-based optimization, possibly deteriorating the search performance compared with a noiseless scenario. Explicit averaging takes the sample average of noisy objective function values and is widely used as a simple and versatile noise-handling technique. Although it is suitable for various applications, it is ineffective if the mean is not finite. We theoretically reveal that explicit averaging has a negative effect on the estimation of ground-truth rankings when assuming stably distributed noise without a finite mean. Alternatively, sign averaging is proposed as a simple but robust noise-handling technique. We theoretically prove that the sign averaging estimates the order of the medians of the noisy objective function values of a pair of points with arbitrarily high probability as the number of samples increases. Its advantages over explicit averaging and its robustness are also confirmed through numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。