Research map / Learning theory and algorithms / Combinatorial and search optimization
Optimistic Bayesian Optimization with Unknown Constraints
Quoc Phong Nguyen, Wan Theng Ruth Chew, Le Song, Bryan Kian Hsiang Low, Patrick Jaillet
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes an optimistic Bayesian optimization method with a theoretical guarantee for the decoupled setting, where objective and constraint functions are evaluated independently at different inputs.
Problem
Constrained Bayesian optimization in the decoupled setting, where the objective and unknown constraints can be evaluated separately at different inputs, lacks a principled approach with theoretical performance guarantees.
Approach
A principled optimistic BO approach for the decoupled setting that comes with a theoretical performance guarantee, relaxing the coupled setting where all functions must be evaluated at the same input.
Closest papers by meaning
- Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization (ICLR 2024 · similarity 0.88)
- Constrained Bayesian Optimization under Partial Observations: Balanced Improvements and Provable Convergence (AAAI 2024 · similarity 0.88)
- A General Framework for User-Guided Bayesian Optimization (ICLR 2024 · similarity 0.87)
- Principled Preferential Bayesian Optimization (ICML 2024 · similarity 0.87)
- BayeSQP: Bayesian Optimization through Sequential Quadratic Programming (NeurIPS 2025 · similarity 0.87)
- Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
