Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization

Michael S. Yao, James C. Gee, Osbert Bastani
1/30/2025
cs.LGcs.AI

No official code found. Best implementation: michael-s-yao/DynAMO (1 star, MIT, last commit 2025-05-21).

Abstract

The goal of offline model-based optimization (MBO) is to propose new designs that maximize a reward function given only an offline dataset. However, an important desiderata is to also propose a diverse set of final candidates that capture many optimal and near-optimal design configurations. We propose Diversity in Adversarial Model-based Optimization (DynAMO) as a novel method to introduce design diversity as an explicit objective into any MBO problem. Our key insight is to formulate diversity as a distribution matching problem where the distribution of generated designs captures the inherent diversity contained within the offline dataset. Extensive experiments spanning multiple scientific domains show that DynAMO can be used with common optimization methods to significantly improve the diversity of proposed designs while still discovering high-quality candidates.

View on arXivView PDF

Code Implementations(1)

MIT

Official Implementation for "Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization" accepted to ICML 2025

10Shell, PythonNov 16, 20241 years agoMIT
ai4sciencegenerative-designmbooffline-optimization

Similar Papers

Cite this paper

@article{yao2025diversity,
  title  = {Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization},
  author = {Michael S. Yao and James C. Gee and Osbert Bastani},
  year   = {2025},
  eprint = {2501.18768},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.18768v2},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.18768.svg)](https://codeofpaper.com/paper/2501.18768)

Discussion