Offline Multi-Objective Optimization
Ke Xue, Rong-Xi Tan, Xiaobin Huang, Chao Qian

TL;DR
This paper introduces the first benchmark for offline multi-objective optimization, providing datasets and analysis tools to advance research in this challenging area, with empirical results showing promising improvements.
Contribution
It presents a comprehensive benchmark for offline MOO and analyzes how existing methods can be adapted, addressing a significant gap in the field.
Findings
Empirical results outperform training set best values.
No single method significantly outperforms others.
Highlights open challenges and future directions in offline MOO.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Advanced Control Systems Optimization · Process Optimization and Integration
