Research map / Probabilistic and scientific modeling / Bayesian optimization
Bayesian Optimization with Cost-varying Variable Subsets
Sebastian Shenghong Tay, Chuan-Sheng Foo, Daisuke Urano, Richalynn Leong, Bryan Kian Hsiang Low
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| use UCB-CVS with cheap control sets for exploration instead of only the full-query control set (TS-PSQ, UCB-PSQ) | UCB-CVS · GP sample, Hartmann, plant growth; cheap and moderate costs | simple regret | Improved |
| increase control set costs from cheap to expensive | UCB-CVS vs TS-PSQ · GP sample, Hartmann, plant growth | simple regret advantage | Hurt |
| use fixed plays per cost group (ETC-50, ETC-100) instead of cost-adaptive 4/c_j plays (ETC-Ada) (ablation) | UCB-CVS ETC variant · expensive cost set | simple regret | Hurt |
| use control sets that are not subsets of each other (airfoil objective) | TS-PSQ and UCB-PSQ versus UCB-CVS · Airfoil self-noise | simple regret | Mixed |
| increase variance of the random-variable distributions from 0.02 to 0.08 (ablation) | UCB-CVS and baselines · 42 experimental settings | lowest mean simple regret count: 11, 6, and 25 | Mixed |
| divide acquisition scores by cost for TS-PSQ and UCB-PSQ (ablation) | TS-PSQ, UCB-PSQ · GP prior, moderate costs | simple regret convergence | Hurt |
| divide expected improvement by cost (ablation) | EI-PSQ · GP prior, moderate costs | simple regret | No clear effect |
Closest papers by meaning
- Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs (AAAI 2025 · similarity 0.96)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.88)
- Principled Preferential Bayesian Optimization (ICML 2024 · similarity 0.88)
- Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds (ICML 2024 · similarity 0.88)
- Stopping Bayesian Optimization with Probabilistic Regret Bounds (NeurIPS 2024 · similarity 0.87)
- BayeSQP: Bayesian Optimization through Sequential Quadratic Programming (NeurIPS 2025 · 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.
