AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Constrained Efficient Global Optimization of Expensive Black-box Functions

ICML 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 11 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use LCB surrogates for objective and constraints in auxiliary problem (optimism) instead of penalty or safe setsCONFIG · Sampled GP instancescumulative regret and violationHelped
Replace fixed penalty / safe set with optimistic feasible-set LCB approachconstrained GP optimization · Artificial numerical problems P3, P4constrained regretHurt
Declare infeasibility when min LCB of a constraint exceeds zeroCONFIG · Infeasible sampled GP instancessteps to declare infeasibilityHelped
Set beta_{i,t} to a constant 3 rather than theoretical scheduleCONFIG · Sampled GP instances and building tuningqualitative performanceNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy