SnAKe:带路径探索的贝叶斯优化
SnAKe: Bayesian Optimization with Pathwise Exploration
摘要:
贝叶斯优化是优化昂贵的黑盒函数的一个非常有效的工具。受应用程序开发和表征使用液滴微流控反应器的反应化学的启发,我们考虑了一种新的设置,其中当在迭代之间进行大的输入变化时,评估函数的费用可能会显着增加。我们进一步假设我们是异步工作的,这意味着我们必须在评估以前的实验之前选择新的查询。本文研究了这个问题,并介绍了“通过自适应连接样本的顺序贝叶斯优化”(SnAKe),它提供了一个解决方案,考虑大批量的查询和抢先建立优化路径,最大限度地减少输入成本。我们研究了一些收敛特性,并实证表明,该算法是能够实现类似于经典的贝叶斯优化算法在同步和异步设置的遗憾,同时大大降低了输入成本。我们表明,该方法是强大的选择其单一的超参数,并提供了一个无参数的替代。
英文摘要:
Bayesian Optimization is a very effective tool for optimizing expensive black-box functions. Inspired by applications developing and characterizing reaction chemistry using droplet microfluidic reactors, we consider a novel setting where the expense of evaluating the function can increase significantly when making large input changes between iterations. We further assume we are working asynchronously, meaning we have to select new queries before evaluating previous experiments. This paper investigates the problem and introduces 'Sequential Bayesian Optimization via Adaptive Connecting Samples' (SnAKe), which provides a solution by considering large batches of queries and preemptively building optimization paths that minimize input costs. We investigate some convergence properties and empirically show that the algorithm is able to achieve regret similar to classical Bayesian Optimization algorithms in both synchronous and asynchronous settings, while reducing input costs significantly. We show the method is robust to the choice of its single hyper-parameter and provide a parameter-free alternative.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。