Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.04000 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911484242558976 |
|---|---|
| author | Lyu, Shen-Huan Tan, Rong-Xi Xue, Ke He, Yi-Xiao Huang, Yu Zhang, Qingfu Qian, Chao |
| author_facet | Lyu, Shen-Huan Tan, Rong-Xi Xue, Ke He, Yi-Xiao Huang, Yu Zhang, Qingfu Qian, Chao |
| contents | Offline model-based optimization (MBO) seeks to discover high-performing designs using only a fixed dataset of past evaluations. Most existing methods rely on learning a surrogate model via regression and implicitly assume that good predictive accuracy leads to good optimization performance. In this work, we challenge this assumption and study offline MBO from a learnability perspective. We argue that offline optimization is fundamentally a problem of ranking high-quality designs rather than accurate value prediction. Specifically, we introduce an optimization-oriented risk based on ranking between near-optimal and suboptimal designs, and develop a unified theoretical framework that connects surrogate learning to final optimization. We prove the theoretical advantages of ranking over regression, and identify distributional mismatch between the training data and near-optimal designs as the dominant error. Inspired by this, we design a distribution-aware ranking method to reduce this mismatch. Empirical results across various tasks show that our approach outperforms twenty existing methods, validating our theoretical findings. Additionally, both theoretical and empirical results reveal intrinsic limitations in offline MBO, showing a regime in which no offline method can avoid over-optimistic extrapolation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_04000 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Learnability of Offline Model-Based Optimization: A Ranking Perspective Lyu, Shen-Huan Tan, Rong-Xi Xue, Ke He, Yi-Xiao Huang, Yu Zhang, Qingfu Qian, Chao Machine Learning Offline model-based optimization (MBO) seeks to discover high-performing designs using only a fixed dataset of past evaluations. Most existing methods rely on learning a surrogate model via regression and implicitly assume that good predictive accuracy leads to good optimization performance. In this work, we challenge this assumption and study offline MBO from a learnability perspective. We argue that offline optimization is fundamentally a problem of ranking high-quality designs rather than accurate value prediction. Specifically, we introduce an optimization-oriented risk based on ranking between near-optimal and suboptimal designs, and develop a unified theoretical framework that connects surrogate learning to final optimization. We prove the theoretical advantages of ranking over regression, and identify distributional mismatch between the training data and near-optimal designs as the dominant error. Inspired by this, we design a distribution-aware ranking method to reduce this mismatch. Empirical results across various tasks show that our approach outperforms twenty existing methods, validating our theoretical findings. Additionally, both theoretical and empirical results reveal intrinsic limitations in offline MBO, showing a regime in which no offline method can avoid over-optimistic extrapolation. |
| title | On the Learnability of Offline Model-Based Optimization: A Ranking Perspective |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2603.04000 |