ROMO:检索增强的离线基于模型优化
ROMO: Retrieval-enhanced Offline Model-based Optimization
AI总结:
本文研究受约束的离线黑盒优化问题,提出检索增强方法 ROMO,通过聚合离线数据集相关样本提供可信预测并用于基于梯度的优化,在多项基准任务上超越现有方法。
摘要:
数据驱动的黑盒基于模型优化(MBO)问题大量出现在实际应用场景中,其目标是在整个空间中找到一个设计,基于静态离线数据集最大化黑盒目标函数。在本研究中,我们考虑一种更通用但更具挑战性的 MBO 设定,称为受约束的 MBO(CoMBO),其中只有部分设计空间可以被优化,而其余部分受环境约束。CoMBO 带来的一个新挑战是,大多数满足约束的观测设计在评估中表现平庸。因此,我们专注于在离线数据集中优化这些平庸设计,同时保持给定约束,而不是在传统 MBO 设定中进一步提升最佳观测设计。我们提出了检索增强的离线基于模型优化(ROMO),这是一种新的可导前向方法,它检索离线数据集并聚合相关样本以提供可信预测,并将其用于基于梯度的优化。ROMO 实现简单,并在 CoMBO 设定中超越了最先进的方法。在实验中,我们在合成的 Hartmann (3D) 函数数据集、工业 CIO 数据集以及 Design-Bench 基准中的修改任务套件上进行了实验。结果表明,ROMO 在广泛的约束优化任务中表现良好。
英文摘要:
Data-driven black-box model-based optimization (MBO) problems arise in a great number of practical application scenarios, where the goal is to find a design over the whole space maximizing a black-box target function based on a static offline dataset. In this work, we consider a more general but challenging MBO setting, named constrained MBO (CoMBO), where only part of the design space can be optimized while the rest is constrained by the environment. A new challenge arising from CoMBO is that most observed designs that satisfy the constraints are mediocre in evaluation. Therefore, we focus on optimizing these mediocre designs in the offline dataset while maintaining the given constraints rather than further boosting the best observed design in the traditional MBO setting. We propose retrieval-enhanced offline model-based optimization (ROMO), a new derivable forward approach that retrieves the offline dataset and aggregates relevant samples to provide a trusted prediction, and use it for gradient-based optimization. ROMO is simple to implement and outperforms state-of-the-art approaches in the CoMBO setting. Empirically, we conduct experiments on a synthetic Hartmann (3D) function dataset, an industrial CIO dataset, and a suite of modified tasks in the Design-Bench benchmark. Results show that ROMO performs well in a wide range of constrained optimization tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。