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

随机搜索对固定大小Pareto集逼近的随机收敛性

Stochastic convergence of random search to fixed size Pareto set approximations

Marco Laumanns

摘要:

本文给出了随机搜索算法到Pareto集的一个子集的第一个收敛结果,该子集具有给定的最大尺寸k和近似质量的界。该算法的核心是基于目标空间上假设的多级网格的新的选择准则。它示出,当使用这个标准接受新的搜索点,解决方案档案序列收敛概率为1的帕累托集的一个子集,ε主导整个帕累托集。所获得的近似质量等于网格单元在最精细分辨率水平上的大小,该分辨率水平允许在考虑的网格族内具有至多k个点的近似。虽然收敛的结果是一般的理论兴趣,归档算法可能是任何类型的迭代多目标最优化方法,如进化算法或其他metasteristics,这一切都依赖于使用有限的在线存储器来存储最佳解决方案,发现到目前为止的帕累托集的近似的高实用价值。

英文摘要:

This paper presents the first convergence result for random search algorithms to a subset of the Pareto set of given maximum size k with bounds on the approximation quality. The core of the algorithm is a new selection criterion based on a hypothetical multilevel grid on the objective space. It is shown that, when using this criterion for accepting new search points, the sequence of solution archives converges with probability one to a subset of the Pareto set that epsilon-dominates the entire Pareto set. The obtained approximation quality epsilon is equal to the size of the grid cells on the finest level of resolution that allows an approximation with at most k points within the family of grids considered. While the convergence result is of general theoretical interest, the archiving algorithm might be of high practical value for any type iterative multiobjective optimization method, such as evolutionary algorithms or other metaheuristics, which all rely on the usage of a finite on-line memory to store the best solutions found so far as the current approximation of the Pareto set.

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

↑