Modeling Multi-Objective Tradeoffs with Monotonic Utility Functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915906980937728 |
|---|---|
| author | Chen, Edward Dullerud, Natalie Niedermayr, Thomas Kidd, Elizabeth Senanayake, Ransalu Koh, Pang Wei Koyejo, Sanmi Guestrin, Carlos |
| author_facet | Chen, Edward Dullerud, Natalie Niedermayr, Thomas Kidd, Elizabeth Senanayake, Ransalu Koh, Pang Wei Koyejo, Sanmi Guestrin, Carlos |
| contents | Countless science and engineering applications in multi-objective optimization (MOO) necessitate that decision-makers (DMs) select a Pareto-optimal (PO) solution which aligns with their preferences. Evaluating individual solutions is often expensive, and the high-dimensional trade-off space makes exhaustive exploration of the full Pareto frontier (PF) infeasible. We introduce a novel, principled two-step process for obtaining a compact set of PO points that aligns with user preferences, which are specified a priori as general monotonic utility functions (MFs). Our process (1) densely samples the user's region of interest on the PF, then (2) sparsifies the results into a small, diverse set for the DM. We instantiate this framework with soft-hard functions (SHFs), an intuitive class of MFs that operationalizes the common expert heuristic of imposing soft and hard bounds. We provide extensive empirical validation of our framework instantiated with SHFs on diverse domains, including brachytherapy, engineering design, and large language models. For brachytherapy, our approach returns a compact set of points with over 3% greater SHF-defined utility than the next best approach. Among the other domains, our approach consistently leads in utility, as a final compact set of just 5 points captures over 99% of the utility offered by the entire dense set. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06154 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Modeling Multi-Objective Tradeoffs with Monotonic Utility Functions Chen, Edward Dullerud, Natalie Niedermayr, Thomas Kidd, Elizabeth Senanayake, Ransalu Koh, Pang Wei Koyejo, Sanmi Guestrin, Carlos Machine Learning Artificial Intelligence Countless science and engineering applications in multi-objective optimization (MOO) necessitate that decision-makers (DMs) select a Pareto-optimal (PO) solution which aligns with their preferences. Evaluating individual solutions is often expensive, and the high-dimensional trade-off space makes exhaustive exploration of the full Pareto frontier (PF) infeasible. We introduce a novel, principled two-step process for obtaining a compact set of PO points that aligns with user preferences, which are specified a priori as general monotonic utility functions (MFs). Our process (1) densely samples the user's region of interest on the PF, then (2) sparsifies the results into a small, diverse set for the DM. We instantiate this framework with soft-hard functions (SHFs), an intuitive class of MFs that operationalizes the common expert heuristic of imposing soft and hard bounds. We provide extensive empirical validation of our framework instantiated with SHFs on diverse domains, including brachytherapy, engineering design, and large language models. For brachytherapy, our approach returns a compact set of points with over 3% greater SHF-defined utility than the next best approach. Among the other domains, our approach consistently leads in utility, as a final compact set of just 5 points captures over 99% of the utility offered by the entire dense set. |
| title | Modeling Multi-Objective Tradeoffs with Monotonic Utility Functions |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2412.06154 |