Achieving Diversity in Objective Space for Sample-efficient Search of Multiobjective Optimization Problems

Eric Hans Lee, Bolong Cheng, Michael McCourt
6/23/2023
cs.AImath.OC

No confident code implementation found for this paper.

Abstract

Efficiently solving multi-objective optimization problems for simulation optimization of important scientific and engineering applications such as materials design is becoming an increasingly important research topic. This is due largely to the expensive costs associated with said applications, and the resulting need for sample-efficient, multiobjective optimization methods that efficiently explore the Pareto frontier to expose a promising set of design solutions. We propose moving away from using explicit optimization to identify the Pareto frontier and instead suggest searching for a diverse set of outcomes that satisfy user-specified performance criteria. This method presents decision makers with a robust pool of promising design decisions and helps them better understand the space of good solutions. To achieve this outcome, we introduce the Likelihood of Metric Satisfaction (LMS) acquisition function, analyze its behavior and properties, and demonstrate its viability on various problems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lee2023achieving,
  title  = {Achieving Diversity in Objective Space for Sample-efficient Search of Multiobjective Optimization Problems},
  author = {Eric Hans Lee and Bolong Cheng and Michael McCourt},
  year   = {2023},
  eprint = {2306.13780},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.13780v1}
}

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/2306.13780.svg)](https://codeofpaper.com/paper/2306.13780)

Discussion