arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.01277math.OC
收藏

确保黑盒全局优化中分位数改进的基于散度的条件

A divergence-based condition to ensure quantile improvement in black-box global optimization

Thomas Guilmeau, Emilie Chouzenoux, Víctor Elvira

AI总结:

本文提出基于散度减小条件的新框架,用于研究和设计黑盒全局优化算法,量化每次迭代提议在期望值或分位数上的改进,并应用于分析信息几何优化及两种新算法。

摘要:

黑盒全局优化旨在最小化解析形式未知的目标函数。为此,许多最先进的方法依赖于基于采样的策略,其中采样分布以迭代方式构建,使其质量集中在目标函数值较低的区域。尽管取得了经验上的成功,这些方法的理论研究仍然困难。在这项工作中,我们引入了一个基于散度减小条件的新框架,用于研究和设计黑盒全局优化算法。我们的方法能够确立并量化每次迭代中提议在目标函数的期望值或分位数方面的改进。我们证明了信息几何优化方法符合我们的框架,为其分析提供了一种新途径。我们还为两种新算法确立了提议改进结果,一种与使用混合模型的交叉熵方法相关,另一种使用重尾采样提议分布。

英文摘要:

Black-box global optimization aims at minimizing an objective function whose analytical form is not known. To do so, many state-of-the-art methods rely on sampling-based strategies, where sampling distributions are built in an iterative fashion, so that their mass concentrate where the objective function is low. Despite empirical success, the theoretical study of these methods remains difficult. In this work, we introduce a new framework, based on divergence-decrease conditions, to study and design black-box global optimization algorithms. Our approach allows to establish and quantify the improvement of proposals at each iteration, in terms of expected value or quantile of the objective. We show that the information-geometric optimization approach fits within our framework, yielding a new approach for its analysis. We also establish proposal improvement results for two novel algorithms, one related with the cross-entropy approach with mixture models, and another one using heavy-tailed sampling proposal distributions.

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

↑