Offline Model-Based Optimization by Learning to Rank
Rong-Xi Tan, Ke Xue, Shen-Huan Lyu, Haopu Shang, Yao Wang, Yaoyuan Wang, Sheng Fu, Chao Qian
Abstract
Offline model-based optimization (MBO) aims to identify a design that maximizes a black-box function using only a fixed, pre-collected dataset of designs and their corresponding scores. This problem has garnered significant attention from both scientific and industrial domains. A common approach in offline MBO is to train a regression-based surrogate model by minimizing mean squared error (MSE) and then find the best design within this surrogate model by different optimizers (e.g., gradient ascent). However, a critical challenge is the risk of out-of-distribution errors, i.e., the surrogate model may typically overestimate the scores and mislead the optimizers into suboptimal regions. Prior works have attempted to address this issue in various ways, such as using regularization techniques and ensemble learning to enhance the robustness of the model, but it still remains. In this paper, we argue that regression models trained with MSE are not well-aligned with the primary goal of offline MBO, which is to select promising designs rather than to predict their scores precisely. Notably, if a surrogate model can maintain the order of candidate designs based on their relative score relationships, it can produce the best designs even without precise predictions. To validate it, we conduct experiments to compare the relationship between the quality of the final designs and MSE, finding that the correlation is really very weak. In contrast, a metric that measures order-maintaining quality shows a significantly stronger correlation. Based on this observation, we propose learning a ranking-based model that leverages learning to rank techniques to prioritize promising designs based on their relative scores. We show that the generalization error on ranking loss can be well bounded. Empirical results across diverse tasks demonstrate the superior performance of our proposed ranking-based method than twenty existing methods. Our implementation is available at https://github.com/ lamda-bbo/Offline-RaM .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5e27620d-30a6-40f6-a9c9-8ca0a213238aCited by top-tier papers5
- ROOT: Rethinking Offline Optimization as Distributional Translation via Probabilistic BridgeCuong Dao, The Hung Tran, Phi Le Nguyen, Truong Thao Nguyen et al.NeurIPS 2025 · 4 citations
- SOO-Bench: Benchmarks for Evaluating the Stability of Offline Black-Box OptimizationHong Qian, Yiyi Zhu, Xiang Shu, Shuo Liu et al.ICLR 2025
- Diversity By Design: Leveraging Distribution Matching for Offline Model-Based OptimizationMichael S. Yao, James C. Gee, Osbert BastaniICML 2025
- Support-Proximity Augmented Diffusion Estimation for Offline Black-Box OptimizationYonghan Yang, Ye Yuan, Zipeng Sun, Linfeng Du et al.ICML 2026
- Towards Universal Offline Black-Box Optimization via Learning Language Model EmbeddingsRong-Xi Tan, Ming Chen, Ke Xue, Yao Wang et al.ICML 2025
Builds on29
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Preference Ranking Optimization for Human AlignmentFeifan Song, Bowen Yu, Minghao Li, Haiyang Yu et al.AAAI 2024 · 357 citations
- Accelerating Bayesian Optimization for Biological Sequence Design with Denoising AutoencodersSamuel Stanton, Wesley J. Maddox, Nate Gruver, Phillip M. Maffettone et al.ICML 2022 · 137 citations
- Design-Bench: Benchmarks for Data-Driven Offline Model-Based OptimizationBrandon Trabucco, Xinyang Geng, Aviral Kumar, Sergey LevineICML 2022 · 126 citations
- Conservative Objective Models for Effective Offline Model-Based OptimizationBrandon Trabucco, Aviral Kumar, Xinyang Geng, Sergey LevineICML 2021 · 119 citations
Related papers
- Learning Surrogates for Offline Black-Box Optimization via Gradient MatchingMinh Hoang, Azza Fadhel, Aryan Deshwal, Jana Doppa et al.ICML 2024 · 18 citations
- Incorporating Surrogate Gradient Norm to Improve Offline Optimization TechniquesCuong Dao, Phi Le Nguyen, Truong Thao Nguyen, Nghia HoangNeurIPS 2024 · 8 citations
- Offline Model-Based Optimization via Policy-Guided Gradient SearchYassine Chemingui, Aryan Deshwal, Trong Nghia Hoang, Janardhan Rao DoppaAAAI 2024 · 22 citations
- Boosting Offline Optimizers with Surrogate SensitivityManh Cuong Dao, Phi Le Nguyen, Truong Thao Nguyen, Trong Nghia HoangICML 2024 · 10 citations
- Parallel-mentoring for Offline Model-based OptimizationCan Chen, Christopher Beckham, Zixuan Liu, Xue (Steve) Liu et al.NeurIPS 2023 · 36 citations
