Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Boundary Exploration for Bayesian Optimization With Unknown Physical Constraints (2402.07692v2)

Published 12 Feb 2024 in cs.LG

Abstract: Bayesian optimization has been successfully applied to optimize black-box functions where the number of evaluations is severely limited. However, in many real-world applications, it is hard or impossible to know in advance which designs are feasible due to some physical or system limitations. These issues lead to an even more challenging problem of optimizing an unknown function with unknown constraints. In this paper, we observe that in such scenarios optimal solution typically lies on the boundary between feasible and infeasible regions of the design space, making it considerably more difficult than that with interior optima. Inspired by this observation, we propose BE-CBO, a new Bayesian optimization method that efficiently explores the boundary between feasible and infeasible designs. To identify the boundary, we learn the constraints with an ensemble of neural networks that outperform the standard Gaussian Processes for capturing complex boundaries. Our method demonstrates superior performance against state-of-the-art methods through comprehensive experiments on synthetic and real-world benchmarks. Code available at: https://github.com/yunshengtian/BE-CBO

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (8)
  1. Yunsheng Tian (8 papers)
  2. Ane Zuniga (1 paper)
  3. Xinwei Zhang (37 papers)
  4. Johannes P. Dürholt (5 papers)
  5. Payel Das (104 papers)
  6. Jie Chen (602 papers)
  7. Wojciech Matusik (76 papers)
  8. Mina Konaković Luković (5 papers)
Citations (1)