The reviewed record of science sign in
Pith

arxiv: 2501.18768 · v2 · pith:FH6NXCWK · submitted 2025-01-30 · cs.LG · cs.AI

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FH6NXCWKrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords diversityofflineoptimizationdesigndesignsdistributionmodel-basedpropose
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.