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

三目标积分R2子集选择:NP困难性与子模近似

Three-Objective Integral R2 Subset Selection: NP-Hardness and Submodular Approximation

Michael T. M. Emmerich

AI总结:

针对三目标优化中积分R2指标的子集选择问题,证明其NP困难性,同时发现R2改进函数具有单调子模性,从而给出(1-1/e)近似保证的贪心算法。

摘要:

从有限帕累托前沿近似中选择固定数量的代表点是多目标优化中的基本后处理任务。本文研究了三个目标中积分R2指标的这一选择问题,其中该指标定义为加权切比雪夫标量化在二维权重单纯形上的下包络积分。我们提供了两个互补的算法结果。在正面,我们证明相对于任何固定基线的积分R2改进是一个单调子模集函数。对于通常的基于理想点的R2指标(理想点固定),这直接给出了一个间隙缩减保证:贪心选择至少关闭了固定支配锚点值与最佳基数k值之间最大可能R2间隙的$(1-1/e)$部分。我们还给出了一个经过测试的贪心实现,通过细分计算精确的积分R2值,最坏情况运行时间为$O(n^6)$。在负面,我们证明即使在三个目标中,精确固定基数子集选择已经是NP困难的。困难性证明使用了一种透视变换,将切比雪夫阴影改进映射到密度为$(x_1+x_2+x_3)^{-4}$的加权锚定盒子并问题,然后改编了Bringmann、Cabello和Emmerich的三维锚定盒子构造。这些结果共同将易处理的二目标情况与三目标情况区分开来,同时识别出基于子模优化的原则性近似路径。

英文摘要:

Selecting a fixed number of representative points from a finite Pareto-front approximation is a fundamental post-processing task in multiobjective optimization. This paper studies this problem for the integral R2 indicator in three objectives, where the indicator is defined as the integral of the lower envelope of weighted Tchebycheff scalarizations over the two-dimensional weight simplex. We provide two complementary algorithmic results. On the positive side, we show that the integral R2 improvement with respect to any fixed baseline is a monotone submodular set function. For the usual ideal-point based R2 indicator, with the ideal point fixed, this yields a direct gap-reduction guarantee: greedy selection closes at least a $(1-1/e)$-fraction of the maximum possible R2 gap between a fixed dominated anchor value and the best cardinality-$k$ value. We also give a tested greedy implementation that evaluates exact integral R2 values by subdivision, with worst-case running time $O(n^6)$. On the negative side, we prove that exact fixed-cardinality subset selection is NP-hard already in three objectives. The hardness proof uses a perspective transformation that maps Tchebycheff-shadow improvements to a weighted anchored-box union problem with density $(x_1+x_2+x_3)^{-4}$, and then adapts the three-dimensional anchored-box construction of Bringmann, Cabello, and Emmerich. Together, these results separate the tractable two-objective case from the three-objective case while identifying a principled approximation route based on submodular optimization.

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

↑