Multiobjective Optimization Using the R2 Utility

IF 10.8 1区 数学 Q1 MATHEMATICS, APPLIED
SIAM Review Pub Date : 2025-05-08 DOI:10.1137/23m1578371
Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei
{"title":"Multiobjective Optimization Using the R2 Utility","authors":"Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei","doi":"10.1137/23m1578371","DOIUrl":null,"url":null,"abstract":"SIAM Review, Volume 67, Issue 2, Page 213-255, May 2025. <br/> Abstract.The goal of multiobjective optimization is to identify a collection of points which describe the best possible trade-offs among the multiple objectives. In order to solve this vector-valued optimization problem, practitioners often appeal to the use of scalarization functions in order to transform the multiobjective problem into a collection of single-objective problems. This set of scalarized problems can then be solved using traditional single-objective optimization techniques. In this paper, we formalize this convention into a general mathematical framework. We show how this strategy effectively recasts the original multiobjective optimization problem into a single-objective optimization problem defined over sets. An appropriate class of objective functions for this new problem is that of the R2 utilities, which are utility functions that are defined as a weighted integral over the scalarized optimization problem. As part of our work, we show that these utilities are monotone and submodular set functions that can be optimized effectively using greedy optimization algorithms. We then analyze the performance of these greedy algorithms both theoretically and empirically. Our analysis largely focuses on Bayesian optimization, which is a popular probabilistic framework for black-box optimization.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"72 1","pages":""},"PeriodicalIF":10.8000,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Review","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1578371","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Review, Volume 67, Issue 2, Page 213-255, May 2025.
Abstract.The goal of multiobjective optimization is to identify a collection of points which describe the best possible trade-offs among the multiple objectives. In order to solve this vector-valued optimization problem, practitioners often appeal to the use of scalarization functions in order to transform the multiobjective problem into a collection of single-objective problems. This set of scalarized problems can then be solved using traditional single-objective optimization techniques. In this paper, we formalize this convention into a general mathematical framework. We show how this strategy effectively recasts the original multiobjective optimization problem into a single-objective optimization problem defined over sets. An appropriate class of objective functions for this new problem is that of the R2 utilities, which are utility functions that are defined as a weighted integral over the scalarized optimization problem. As part of our work, we show that these utilities are monotone and submodular set functions that can be optimized effectively using greedy optimization algorithms. We then analyze the performance of these greedy algorithms both theoretically and empirically. Our analysis largely focuses on Bayesian optimization, which is a popular probabilistic framework for black-box optimization.
使用R2实用工具的多目标优化
SIAM评论,第67卷,第2期,第213-255页,2025年5月。摘要。多目标优化的目标是确定一个点的集合,这些点描述了多个目标之间的最佳可能权衡。为了解决这个向量值优化问题,从业者经常求助于使用标量化函数,以便将多目标问题转化为单目标问题的集合。这组问题可以用传统的单目标优化技术来解决。在本文中,我们将这一约定形式化为一般的数学框架。我们展示了该策略如何有效地将原来的多目标优化问题转化为在集合上定义的单目标优化问题。对于这个新问题,一个合适的目标函数是R2效用函数,它是效用函数,被定义为标化优化问题上的加权积分。作为我们工作的一部分,我们证明了这些实用程序是单调的和次模集合函数,可以使用贪婪优化算法有效地优化。然后我们从理论上和经验上分析了这些贪婪算法的性能。我们的分析主要集中在贝叶斯优化,这是一个流行的概率框架的黑盒优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
SIAM Review
SIAM Review 数学-应用数学
CiteScore
16.90
自引率
0.00%
发文量
50
期刊介绍: Survey and Review feature papers that provide an integrative and current viewpoint on important topics in applied or computational mathematics and scientific computing. These papers aim to offer a comprehensive perspective on the subject matter. Research Spotlights publish concise research papers in applied and computational mathematics that are of interest to a wide range of readers in SIAM Review. The papers in this section present innovative ideas that are clearly explained and motivated. They stand out from regular publications in specific SIAM journals due to their accessibility and potential for widespread and long-lasting influence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信