{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T12:29:42Z","timestamp":1787228982617,"version":"build-2736575974"},"reference-count":104,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100004349","name":"BASF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004349","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004332","name":"JPMorgan Chase and Company","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004332","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S023151\/1"],"award-info":[{"award-number":["EP\/S023151\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Rev."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1137\/23m1578371","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T03:58:08Z","timestamp":1746676688000},"page":"213-255","source":"Crossref","is-referenced-by-count":5,"title":["Multiobjective Optimization Using the R2 Utility"],"prefix":"10.1137","volume":"67","author":[{"given":"Ben","family":"Tu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Imperial College London, London, United Kingdom."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolas","family":"Kantas","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Imperial College London, London, United Kingdom."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert M.","family":"Lee","sequence":"additional","affiliation":[{"name":"BASF SE, Ludwigshafen, am Rhein, Germany."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Behrang","family":"Shafei","sequence":"additional","affiliation":[{"name":"BASF SE, Ludwigshafen, am Rhein, Germany."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"ref1","unstructured":"R. Astudillo and P. Frazier, Multi-attribute Bayesian optimization with interactive preference learning, in International Conference on Artificial Intelligence and Statistics, PMLR, 2020, pp. 4496\u20134507. (Cited on p. 234)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.11.016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000039"},{"key":"ref4","first-page":"21524","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Balandat M.","year":"2020"},{"key":"ref5","first-page":"7825","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Belakaria S.","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"ref7","first-page":"7133","volume":"18","author":"Bertsimas D.","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","first-page":"5978","volume":"21","author":"Binois M.","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0609-2"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"D. Brockhoff, T. Wagner, and H. Trautmann, On the properties of the R2 indicator, in Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, ACM, 2012, pp. 465\u2013472. (Cited on p. 223)","DOI":"10.1145\/2330163.2330230"},{"key":"ref11","unstructured":"S. R. Chowdhury and A. Gopalan, No-regret algorithms for multi-task Bayesian optimization, in International Conference on Artificial Intelligence and Statistics, PMLR, 2021, pp. 1873\u20131881. (Cited on pp. 227, 232, 236)"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"W. Chu and Z. Ghahramani, Preference learning with Gaussian processes, in International Conference on Machine Learning, ACM, 2005, pp. 137\u2013144. (Cited on p. 243)","DOI":"10.1145\/1102351.1102369"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185706"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24694-7_71"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"ref17","first-page":"2187","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Daulton S.","year":"2021"},{"key":"ref18","unstructured":"S. Daulton, S. Cakmak, M. Balandat, M. A. Osborne, E. Zhou, and E. Bakshy, Robust multi-objective Bayesian optimization under input noise, in International Conference on Machine Learning, PMLR, 2022, pp. 4831\u20134866. (Cited on pp. 239, 243)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3425501"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014361"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, Scalable multi-objective optimization test problems, in Proceedings of the 2002 Congress on Evolutionary Computation, CEC\u201902 (Cat. No.02TH8600), Vol. 1, 2002, pp. 825\u2013830. (Cited on p. 237)","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref23","unstructured":"T. M. Deist, M. Grewal, F. J. W. M. Dankers, T. Alderliesten, and P. A. N. Bosman, Multi-objective Learning to Predict Pareto Fronts Using Hypervolume Maximization, preprint, https:\/\/arxiv.org\/abs\/2102.04523, 2021. (Cited on p. 245)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2895108"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2012.03.014"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12598-1_29"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48774-3_14"},{"key":"ref28","volume-title":"Multicriteria Optimization","author":"Ehrgott M.","year":"2005"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.03.013"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/060672029"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75514-2_11"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.859463"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/08071692X"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s001860000043"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.028"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/3468.650319"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/9781108348973"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.06.025"},{"key":"ref39","first-page":"250","volume-title":"Uncertainty in Artificial Intelligence","author":"Gelbart M. A.","year":"2014"},{"key":"ref40","first-page":"119:1","volume":"54","author":"Guerreiro A. P.","year":"2021","journal-title":"ACM Comput. Surv."},{"key":"ref41","unstructured":"M. P. Hansen and A. Jaszkiewicz, Evaluating the Quality of Approximations to the Non-Dominated Set, Technical report, Institute of Mathematical Modeling, Technical University of Denmark, 1998. (Cited on pp. 216, 220, 221, 222)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-014-0471-z"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-015-0418-7"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4982991"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref47","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, and \u00c9. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201903, ACM, 2003, pp. 137\u2013146. (Cited on p. 228)","DOI":"10.1145\/956750.956769"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref49","first-page":"17708","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Konakovic Lukovic M.","year":"2020"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref51","doi-asserted-by":"crossref","unstructured":"H. W. Kuhn and A. W. Tucker, Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Vol. 2, University of California Press, 1951, pp. 481\u2013493. (Cited on p. 244)","DOI":"10.1525\/9780520411586-036"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2792984"},{"key":"ref53","unstructured":"Z. J. Lin, R. Astudillo, P. Frazier, and E. Bakshy, Preference exploration for efficient Bayesian optimization with multiple outcomes, in International Conference on Artificial Intelligence and Statistics, PMLR, 2022, pp. 4235\u20134258. (Cited on p. 243)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704118"},{"key":"ref55","unstructured":"D. Mahapatra and V. Rajan, Multi-task learning with user preferences: Gradient descent with controlled ascent in Pareto optimization, in International Conference on Machine Learning, PMLR, 2020, pp. 6597\u20136607. (Cited on p. 245)"},{"key":"ref56","unstructured":"G. Malkomes, B. Cheng, E. H. Lee, and M. McCourt, Beyond the Pareto efficient frontier: Constraint active search for multiobjective experimental design, in International Conference on Machine Learning, PMLR, 2021, pp. 7423\u20137434. (Cited on p. 236)"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-003-0368-6"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"ref59","doi-asserted-by":"crossref","unstructured":"J. Mo\u010dkus, On Bayesian methods for seeking the extremum, in Optimization Techniques IFIP Technical Conference Novosibirsk, Lecture Notes in Comput. Sci., Springer, 1975, pp. 400\u2013404. (Cited on p. 234)","DOI":"10.1007\/3-540-07165-2_55"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2693320"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref62","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006"},{"key":"ref63","first-page":"766","volume-title":"Uncertainty in Artificial Intelligence","author":"Paria B.","year":"2020"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568176"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.5957\/jsr.2004.48.1.61"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-014-9477-x"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0688-0"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_78"},{"key":"ref70","series-title":"Adaptive Comput. Mach. Learn.","volume-title":"Gaussian Processes for Machine Learning","author":"Rasmussen C. E.","year":"2006"},{"key":"ref71","doi-asserted-by":"crossref","unstructured":"N. Riquelme, C. Von L\u00fccken, and B. Baran, Performance metrics in multi-objective optimization, in 2015 Latin American Computing Conference (CLEI), 2015, pp. 1\u201311. (Cited on pp. 219, 222)","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3987"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref74","doi-asserted-by":"crossref","unstructured":"H. Sato, Inverted PBI in MOEA\/D and its impact on the search performance on multi and many-objective optimization, in Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO \u201914, ACM, 2014, pp. 645\u2013652. (Cited on p. 226)","DOI":"10.1145\/2576768.2598297"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015472306888"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161872"},{"key":"ref77","first-page":"525","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Sener O.","year":"2018"},{"key":"ref78","doi-asserted-by":"crossref","unstructured":"K. Shang, H. Ishibuchi, M.L. Zhang, and Y. Liu, A new R2 indicator for better hypervolume approximation, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201918, ACM, 2018, pp. 745\u2013752. (Cited on p. 246)","DOI":"10.1145\/3205455.3205543"},{"key":"ref79","doi-asserted-by":"crossref","unstructured":"A. Singla, S. Tschiatschek, and A. Krause, Noisy submodular maximization via adaptive sampling with applications to crowdsourced image collection summarization, in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 2037\u20132043. (Cited on p. 228)","DOI":"10.1609\/aaai.v30i1.10207"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07494-8_2"},{"key":"ref81","unstructured":"N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger, Gaussian process optimization in the bandit setting: No regret and experimental design, in International Conference on Machine Learning, Vol. 27, 2010, pp. 1015\u20131022. (Cited on p. 236)"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106078"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref84","first-page":"440","volume":"21","author":"Trivedi A.","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref85","first-page":"9922","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Tu B.","year":"2022"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_17"},{"key":"ref87","doi-asserted-by":"crossref","unstructured":"R. Vaidyanathan, K. Tucker, N. Papila, and W. Shyy, CFD-based design optimization for single element rocket injector, in 41st Aerospace Sciences Meeting and Exhibit, Aerospace Sciences Meetings, AIAA, 2003, pp. 1\u201321. (Cited on p. 238)","DOI":"10.2514\/6.2003-296"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_28"},{"key":"ref89","doi-asserted-by":"crossref","unstructured":"K. Van Moffaert, M. M. Drugan, and A. Now\u00e9, Scalarized multi-objective reinforcement learning: Novel design techniques, in 2013 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL), IEEE, 2013, pp. 191\u2013199. (Cited on p. 244)","DOI":"10.1109\/ADPRL.2013.6615007"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_10"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_44"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0053-9"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-003-0345-0"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00923-x"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref96","unstructured":"R. Zhang and D. Golovin, Random hypervolume scalarizations for provable multi-objective black box optimization, in International Conference on Machine Learning, Vol. 37, PMLR, 2020, pp. 11096\u201311105. (Cited on pp. 227, 236, 246)"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9"},{"key":"ref99","unstructured":"L. M. Zintgraf, T. V. Kanters, D. M. Roijers, F. A. Oliehoek, and P. Beau, Quality assessment of MORL algorithms: A utility-based approach, in Annual Machine Learning Conference of Belgium and the Netherlands, CEUR-WS.org, 2015. (Cited on p. 244)"},{"key":"ref100","doi-asserted-by":"crossref","unstructured":"L. M. Zintgraf, D. M. Roijers, S. Linders, C. M. Jonker, and A. Now\u00e9, Ordered preference elicitation strategies for supporting multi-objective decision making, in Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS\u2019 18, ACM, 2018, pp. 1477\u20131485. (Cited on p. 243)","DOI":"10.65109\/CHRG6153"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3_14"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0056872"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref104","first-page":"3619","volume":"17","author":"Zuluaga M.","year":"2016","journal-title":"J. Mach. Learn. Res."}],"container-title":["SIAM Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1578371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T12:09:12Z","timestamp":1787227752000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1578371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":104,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1137\/23M1578371"],"URL":"https:\/\/doi.org\/10.1137\/23m1578371","relation":{},"ISSN":["0036-1445","1095-7200"],"issn-type":[{"value":"0036-1445","type":"print"},{"value":"1095-7200","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]}}}