Uncertainty-Aware Offline Data-Driven Multi-Objective Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913072082321408 |
|---|---|
| author | Lyu, Huanbo Li, Miqing Zhou, Shiqiao Herring, Daniel Ninic, Jelena Zuo, Zheming Wang, Lingfeng Andrews, James Spill, Fabian Wang, Shuo |
| author_facet | Lyu, Huanbo Li, Miqing Zhou, Shiqiao Herring, Daniel Ninic, Jelena Zuo, Zheming Wang, Lingfeng Andrews, James Spill, Fabian Wang, Shuo |
| contents | In offline data-driven multi-objective optimization (MOO), optimization is performed using surrogate models trained only on an offline dataset. These surrogate models contain inherent errors and uncertainty. This epistemic uncertainty can lead to incorrect dominance judgments, thereby misleading the search process. Existing methods mitigate this issue by incorporating uncertainty estimates from Gaussian Process Regression (GPR) to correct dominance judgments; however, they are restricted to GPR, and their optimization strategies cannot be scaled to other uncertainty quantification methods. In addition, GPR-based surrogates suffer from high computational cost. We propose a simple yet effective dual-ranking strategy that flexibly leverages both predictive results and uncertainty estimates from different surrogate models. By performing non-dominated sorting on candidate solutions using both surrogate-based fitness values and uncertainty-aware fitness values, the proposed method prioritizes candidate solutions that are simultaneously high-quality and reliable. Through extensive experimental evaluations, including ablation, sensitivity, and comparative experiments, we demonstrate the effectiveness and robustness of the proposed dual-ranking strategy working with different surrogates. Our dual-ranking framework offers more robust solutions for data-limited, real-world applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_06459 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Uncertainty-Aware Offline Data-Driven Multi-Objective Optimization Lyu, Huanbo Li, Miqing Zhou, Shiqiao Herring, Daniel Ninic, Jelena Zuo, Zheming Wang, Lingfeng Andrews, James Spill, Fabian Wang, Shuo Neural and Evolutionary Computing In offline data-driven multi-objective optimization (MOO), optimization is performed using surrogate models trained only on an offline dataset. These surrogate models contain inherent errors and uncertainty. This epistemic uncertainty can lead to incorrect dominance judgments, thereby misleading the search process. Existing methods mitigate this issue by incorporating uncertainty estimates from Gaussian Process Regression (GPR) to correct dominance judgments; however, they are restricted to GPR, and their optimization strategies cannot be scaled to other uncertainty quantification methods. In addition, GPR-based surrogates suffer from high computational cost. We propose a simple yet effective dual-ranking strategy that flexibly leverages both predictive results and uncertainty estimates from different surrogate models. By performing non-dominated sorting on candidate solutions using both surrogate-based fitness values and uncertainty-aware fitness values, the proposed method prioritizes candidate solutions that are simultaneously high-quality and reliable. Through extensive experimental evaluations, including ablation, sensitivity, and comparative experiments, we demonstrate the effectiveness and robustness of the proposed dual-ranking strategy working with different surrogates. Our dual-ranking framework offers more robust solutions for data-limited, real-world applications. |
| title | Uncertainty-Aware Offline Data-Driven Multi-Objective Optimization |
| topic | Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2511.06459 |