arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.03722cs.LGcs.AIcs.NE
收藏

离线多目标优化

Offline Multi-Objective Optimization

National Key Laboratory for Novel Software Technology(现代软件工程国家重点实验室);School of Artificial Intelligence, Nanjing University(南京大学人工智能学院)

Ke Xue, Rong-Xi Tan, Xiaobin Huang, Chao Qian

AI总结:

本文提出首个离线多目标优化基准,涵盖合成与现实任务,并从数据、模型架构、学习算法和搜索算法四个视角分析现有方法的适配方式,实验证明离线MOO方法有效但仍存在开放挑战。

摘要:

离线优化旨在利用静态数据集最大化黑盒目标函数,具有广泛的应用。除了目标函数是黑盒且评估代价高昂之外,许多复杂的现实世界问题还涉及优化多个相互冲突的目标,即多目标优化(MOO)。然而,离线多目标优化的进展不如离线单目标优化(SOO),主要原因是缺乏像面向SOO的Design-Bench这样的基准。为了弥合这一差距,我们提出了首个离线多目标优化基准,涵盖从合成任务到现实世界任务的一系列问题。该基准提供了任务、数据集和开源示例,可作为离线多目标优化中方法比较和进展的基础。此外,我们从数据、模型架构、学习算法和搜索算法四个基本视角分析了当前相关方法如何适配到离线多目标优化。实证结果表明,相较于训练集的最佳值有所提升,证明了离线多目标优化方法的有效性。由于没有特定方法显著突出,进一步提升离线多目标优化的有效性仍然是一个开放的挑战。最后,我们讨论了离线多目标优化未来的挑战,希望为这一新兴领域提供一些启示。我们的代码可在\url{https://github.com/lamda-bbo/offline-moo}获取。

英文摘要:

Offline optimization aims to maximize a black-box objective function with a static dataset and has wide applications. In addition to the objective function being black-box and expensive to evaluate, numerous complex real-world problems entail optimizing multiple conflicting objectives, i.e., multi-objective optimization (MOO). Nevertheless, offline MOO has not progressed as much as offline single-objective optimization (SOO), mainly due to the lack of benchmarks like Design-Bench for SOO. To bridge this gap, we propose a first benchmark for offline MOO, covering a range of problems from synthetic to real-world tasks. This benchmark provides tasks, datasets, and open-source examples, which can serve as a foundation for method comparisons and advancements in offline MOO. Furthermore, we analyze how the current related methods can be adapted to offline MOO from four fundamental perspectives, including data, model architecture, learning algorithm, and search algorithm. Empirical results show improvements over the best value of the training set, demonstrating the effectiveness of offline MOO methods. As no particular method stands out significantly, there is still an open challenge in further enhancing the effectiveness of offline MOO. We finally discuss future challenges for offline MOO, with the hope of shedding some light on this emerging field. Our code is available at \url{https://github.com/lamda-bbo/offline-moo}.

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

↑