BINOCULARS for efficient, nonmyopic sequential experimental design
Shali Jiang, Henry Chai, Javier González, Roman Garnett
Abstract
Finite-horizon sequential experimental design (SED) arises naturally in many contexts, including hyperparameter tuning in machine learning among more traditional settings. Computing the optimal policy for such problems requires solving Bellman equations, which are generally intractable. Most existing work resorts to severely myopic approximations by limiting the decision horizon to only a single time-step, which can underweight exploration in favor of exploitation. We present BINOCULARS: Batch-Informed NOnmyopic Choices, Using Long-horizons for Adaptive, Rapid SED, a general framework for deriving efficient, nonmyopic approximations to the optimal experimental policy. Our key idea is simple and surprisingly effective: we first compute a one-step optimal batch of experiments, then select a single point from this batch to evaluate. We realize BINOCULARS for Bayesian optimization and Bayesian quadrature -- two notable SED problems with radically different objectives -- and demonstrate that BINOCULARS significantly outperforms myopic alternatives in real-world scenarios.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a220b8f7-814d-42d8-adfa-643cc93ff550Cited by top-tier papers13
- Deep Adaptive Design: Amortizing Sequential Bayesian Experimental DesignAdam Foster, Desi R. Ivanova, Ilyas Malik, Tom RainforthICML 2021 · 119 citations
- A Sober Look at LLMs for Material Discovery: Are They Actually Good for Bayesian Optimization Over Molecules?Agustinus Kristiadi, Felix Strieth-Kalthoff, Marta Skreta, Pascal Poupart et al.ICML 2024 · 55 citations
- Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step TreesShali Jiang, Daniel R. Jiang, Maximilian Balandat, Brian Karrer et al.NeurIPS 2020 · 54 citations
- Reinforced Few-Shot Acquisition Function Learning for Bayesian OptimizationBing-Jing Hsieh, Ping-Chun Hsieh, Xi LiuNeurIPS 2021 · 29 citations
- SnAKe: Bayesian Optimization with Pathwise ExplorationJose Pablo Folch, Shiqiang Zhang, Robert M. Lee, Behrang Shafei et al.NeurIPS 2022 · 24 citations
Related papers
- Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation CostsRaul Astudillo, Daniel R. Jiang, Maximilian Balandat, Eytan Bakshy et al.NeurIPS 2021 · 23 citations
- Constrained Bayesian Experimental Design via Online PlanningYujia Guo, Daolang Huang, Xinyu Zhang, Sammie Katt et al.ICML 2026 · 1 citation
- Bayesian Optimization under Stochastic Delayed FeedbackArun Verma, Zhongxiang Dai, Bryan Kian Hsiang LowICML 2022 · 15 citations
- Two-step lookahead Bayesian optimization with inequality constraintsYunxiang Zhang, Xiangyu Zhang, Peter I. FrazierNeurIPS 2021 · 7 citations
- Hypervolume Knowledge Gradient: A Lookahead Approach for Multi-Objective Bayesian Optimization with Partial InformationSamuel Daulton, Maximilian Balandat, Eytan BakshyICML 2023 · 31 citations
