Uncertainty aware Search Framework for Multi-Objective Bayesian Optimization with Constraints
Not on the map. Why?
Abstract (arXiv)
We consider the problem of constrained multi-objective (MO) blackbox optimization using expensive function evaluations, where the goal is to approximate the true Pareto set of solutions satisfying a set of constraints while minimizing the number of function evaluations. We propose a novel framework named Uncertainty-aware Search framework for Multi-Objective Optimization with Constraints (USeMOC) to efficiently select the sequence of inputs for evaluation to solve this problem. The selection method of USeMOC consists of solving a cheap constrained MO optimization problem via surrogate models of the true functions to identify the most promising candidates and picking the best candidate based on a measure of uncertainty. We applied this framework to optimize the design of a multi-output switched-capacitor voltage regulator via expensive simulations. Our experimental results show that USeMOC is able to achieve more than 90 % reduction in the number of simulations needed to uncover optimized circuits.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2021Bayesian Optimization over Hybrid Spacescited by 23
- 2023Preference-Aware Constrained Multi-Objective Bayesian Optimizationcited by 4
- 2023Preference-Aware Constrained Multi-Objective Bayesian Optimization23 Mar 2023
- 2021Bayesian Optimization over Hybrid Spaces8 Jun 2021