arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.10709math.OC
收藏

带噪声的全局Optimization的带估计和分位数自适应搜索

Hesitant Adaptive Search with Estimation and Quantile Adaptive Search for Global Optimization with Noise

David D. Linz, Zelda B. Zabinsky

摘要:

自适应随机搜索方法已被证明是有效的全局最优化问题,其中在某些条件下,预期的性能时间仅随维数线性增加。然而,以前的分析假设目标函数可以直接观察。我们考虑的情况下,目标函数必须估计,经常使用一个嘈杂的功能,在模拟。我们提出了一个有限的时间分析算法的性能,结合估计与抽样分布。我们提出了一个框架,称为犹豫自适应搜索估计,并推导出一个上界的功能评估,是立方的尺寸,在一定的条件下。我们扩展的框架,分位数自适应搜索估计,重点从一系列嵌套的分位数水平集的采样点。分析表明,计算工作是更好地花费在采样改进点比细化估计的目标函数值在自适应搜索算法的进展。

英文摘要:

Adaptive random search approaches have been shown to be effective for global optimization problems, where under certain conditions, the expected performance time increases only linearly with dimension. However, previous analyses assume that the objective function can be observed directly. We consider the case where the objective function must be estimated, often using a noisy function, as in simulation. We present a finite-time analysis of algorithm performance that combines estimation with a sampling distribution. We present a framework called Hesitant Adaptive Search with Estimation, and derive an upper bound on function evaluations that is cubic in dimension, under certain conditions. We extend the framework to Quantile Adaptive Search with Estimation, which focuses sampling points from a series of nested quantile level sets. The analyses suggest that computational effort is better expended on sampling improving points than refining estimates of objective function values during the progress of an adaptive search algorithm.

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

↑