Timezone: »
Many analog circuit design optimization problems involve performing expensive simulations to evaluate circuit configurations in terms of multiple objectives and constraints; Oftentimes, practitioners have preferences over objectives. We aim to approximate the optimal Pareto set over feasible circuit configurations by minimizing the number of simulations. We propose a novel and efficient preference-aware constrained multi-objective Bayesian optimization (PAC-MOO) approach that learns surrogate models for objectives and constraints and sequentially selects candidate circuits for simulation that maximize the information gained about the optimal constrained Pareto-front while factoring in the objective preferences. Our experiments on real-world problems demonstrate PAC-MOO’s efficacy over prior methods.
Author Information
Alaleh Ahmadian (Washington State University)
Syrine Belakaria (Washington State University)
Jana Doppa (Washington State University)
More from the Same Authors
-
2020 : Scalable Combinatorial Bayesian Optimization with Tractable Statistical models »
Aryan Deshwal · Syrine Belakaria · Janardhan Rao Doppa -
2020 : Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations »
Syrine Belakaria · Aryan Deshwal · Janardhan Rao Doppa -
2022 : Preference-Aware Constrained Multi-Objective Bayesian Optimization »
Alaleh Ahmadian · Syrine Belakaria · Janardhan Rao Doppa -
2022 : Preference-Aware Constrained Multi-Objective Bayesian Optimization »
Alaleh Ahmadian · Syrine Belakaria · Janardhan Rao Doppa -
2022 : Panel »
Roman Garnett · José Miguel Hernández-Lobato · Eytan Bakshy · Syrine Belakaria · Stefanie Jegelka -
2021 Poster: Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces »
Aryan Deshwal · Jana Doppa -
2019 Poster: Max-value Entropy Search for Multi-Objective Bayesian Optimization »
Syrine Belakaria · Aryan Deshwal · Janardhan Rao Doppa