paper-with-me

Papers

Accelerating Look-ahead in Bayesian Optimization: Multilevel Monte Carlo is All you Need

2024-02-03 · Shangda Yang, Vitaly Zankin, Maximilian Balandat, Stefan Scherer, Kevin Carlberg, Neil Walton, Kody J. H. Law

We leverage multilevel Monte Carlo (MLMC) to improve the performance of multi-step look-ahead Bayesian optimization (BO) methods that involve nested expectations and maximizations. Often these expectations must be computed by Monte Carlo (MC). The complexity rate of naive MC degrades for nested operations, whereas MLMC is capable of achieving the canonical MC convergence rate for this type of problem, independently of dimension and without any smoothness assumptions. Our theoretical study focuses on the approximation improvements for twoand three-step look-ahead acquisition functions, but, as we discuss, the approach is generalizable in various ways, including beyond the context of BO. Our findings are verified numerically and the benefits of MLMC for BO are illustrated on several benchmark examples. Code is available at https://github.com/Shangda-Yang/MLMCBO .

📄 PDF Abstract BibTeX arXiv:2402.02111

Code (1)

shangda-yang/mlmcbo 공식 구현 pytorch

Tasks

AllBayesian Optimization

Similar Papers 제목 키워드 기반

Multi-Step Bayesian Optimization for One-Dimensional Feasibility Determination

2016-07-11 · J. Massey Cashore, Lemuel Kumarga, Peter I. Frazier

Bayesian optimization methods allocate limited sampling budgets to maximize expensive-to-evaluate functions. One-step-lookahead policies are often used, but computing optimal multi-step-lookahead policies remains a chall…

Bayesian Optimization

Practical Two-Step Lookahead Bayesian Optimization

2019-12-01 · NeurIPS 2019 12 · Jian Wu, Peter Frazier

Expected improvement and other acquisition functions widely used in Bayesian optimization use a "one-step" assumption: they value objective function evaluations assuming no future evaluations will be performed. Because w…

Bayesian OptimizationVocal Bursts Valence Prediction

EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization

2024-10-31 · Mujin Cheon, Jay H. Lee, Dong-Yeun Koh, Calvin Tsay

Conventional methods for Bayesian optimization (BO) primarily involve one-step optimal decisions (e.g., maximizing expected improvement of the next step). To avoid myopic behavior, multi-step lookahead BO algorithms such…

Bayesian OptimizationDecision MakingHyperparameter OptimizationReinforcement Learning (RL)+1

Non-Myopic Multifidelity Bayesian Optimization

2022-07-13 · Francesco Di Fiore, Laura Mainini

Bayesian optimization is a popular framework for the optimization of black box functions. Multifidelity methods allows to accelerate Bayesian optimization by exploiting low-fidelity representations of expensive objective…

Bayesian Optimization

Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee

2026-05-31 · Shion Takeno arxiv

This paper studies a one-step lookahead Bayesian optimization (BO) method and its theoretical guarantee. Although the empirical effectiveness of one-step lookahead BO methods, such as entropy search, has been studied ext…