English

Generative Adversarial Model-Based Optimization via Source Critic Regularization

Machine Learning 2024-09-27 v2 Artificial Intelligence

Abstract

Offline model-based optimization seeks to optimize against a learned surrogate model without querying the true oracle objective function during optimization. Such tasks are commonly encountered in protein design, robotics, and clinical medicine where evaluating the oracle function is prohibitively expensive. However, inaccurate surrogate model predictions are frequently encountered along offline optimization trajectories. To address this limitation, we propose generative adversarial model-based optimization using adaptive source critic regularization (aSCR) -- a task- and optimizer- agnostic framework for constraining the optimization trajectory to regions of the design space where the surrogate function is reliable. We propose a computationally tractable algorithm to dynamically adjust the strength of this constraint, and show how leveraging aSCR with standard Bayesian optimization outperforms existing methods on a suite of offline generative design tasks. Our code is available at https://github.com/michael-s-yao/gabo

Cite

@article{arxiv.2402.06532,
  title  = {Generative Adversarial Model-Based Optimization via Source Critic Regularization},
  author = {Michael S. Yao and Yimeng Zeng and Hamsa Bastani and Jacob Gardner and James C. Gee and Osbert Bastani},
  journal= {arXiv preprint arXiv:2402.06532},
  year   = {2024}
}

Comments

31 pages, Accepted to NeurIPS 2024

R2 v1 2026-06-28T14:44:15.227Z