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

$γ$-竞争力:Lipschitz函数中高计算成本多目标优化的一种方法

$γ$-Competitiveness: An Approach to Multi-Objective Optimization with High Computation Costs in Lipschitz Functions

Ilgam Latypov, Yuriy Dorn

AI总结:

本文针对高计算成本多目标优化问题,提出无需超参数调优的SWCM方法,并为Lipschitz连续且仅可计算一次的目标函数给出CAoLF近似方案,通过最小成本并发流实验验证了其效率与可扩展性。

摘要:

在实际工程与优化中,求解多目标优化(MOO)问题通常涉及标量化方法,将多目标问题转化为单目标问题。这些方法虽然有效,但由于迭代计算往往产生显著的计算成本,并且还因需要超参数调优而进一步复杂化。本文引入竞争解概念的扩展,并针对多准则问题提出带竞争力的标量化方法(SWCM)。该方法具有高度可解释性,并且无需超参数调优。此外,针对目标函数为Lipschitz连续且只能计算一次的情形,我们提供了一种解决方案,称为Lipschitz函数上的竞争力近似(CAoLF)。当计算资源有限或无法重新计算时,该方法尤其有用。通过在最小成本并发流问题上的计算实验,我们证明了所提方法的效率和可扩展性,凸显了其在各类应用中应对MOO计算挑战的潜力。

英文摘要:

In practical engineering and optimization, solving multi-objective optimization (MOO) problems typically involves scalarization methods that convert a multi-objective problem into a single-objective one. While effective, these methods often incur significant computational costs due to iterative calculations and are further complicated by the need for hyperparameter tuning. In this paper, we introduce an extension of the concept of competitive solutions and propose the Scalarization With Competitiveness Method (SWCM) for multi-criteria problems. This method is highly interpretable and eliminates the need for hyperparameter tuning. Additionally, we offer a solution for cases where the objective functions are Lipschitz continuous and can only be computed once, termed Competitiveness Approximation on Lipschitz Functions (CAoLF). This approach is particularly useful when computational resources are limited or re-computation is not feasible. Through computational experiments on the minimum-cost concurrent flow problem, we demonstrate the efficiency and scalability of the proposed method, underscoring its potential for addressing computational challenges in MOO across various applications.

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

↑