Häse Florian, Roch Loïc M, Kreisbeck Christoph, Aspuru-Guzik Alán
Department of Chemistry and Chemical Biology, Harvard University, Cambridge, Massachusetts 02138, United States.
Department of Chemistry and Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3H6, Canada.
ACS Cent Sci. 2018 Sep 26;4(9):1134-1145. doi: 10.1021/acscentsci.8b00307. Epub 2018 Aug 24.
We report Phoenics, a probabilistic global optimization algorithm identifying the set of conditions of an experimental or computational procedure which satisfies desired targets. Phoenics combines ideas from Bayesian optimization with concepts from Bayesian kernel density estimation. As such, Phoenics allows to tackle typical optimization problems in chemistry for which objective evaluations are limited, due to either budgeted resources or time-consuming evaluations of the conditions, including experimentation or enduring computations. Phoenics proposes new conditions based on all previous observations, avoiding, thus, redundant evaluations to locate the optimal conditions. It enables an efficient parallel search based on intuitive sampling strategies implicitly biasing toward exploration or exploitation of the search space. Our benchmarks indicate that Phoenics is less sensitive to the response surface than already established optimization algorithms. We showcase the applicability of Phoenics on the Oregonator, a complex case-study describing a nonlinear chemical reaction network. Despite the large search space, Phoenics quickly identifies the conditions which yield the desired target dynamic behavior. Overall, we recommend Phoenics for rapid optimization of unknown expensive-to-evaluate objective functions, such as experimentation or long-lasting computations.
我们报告了Phoenics,这是一种概率全局优化算法,用于确定满足期望目标的实验或计算过程的条件集。Phoenics将贝叶斯优化的思想与贝叶斯核密度估计的概念相结合。因此,Phoenics能够解决化学中的典型优化问题,由于资源预算或条件评估耗时(包括实验或持久计算),这些问题的目标评估受到限制。Phoenics根据所有先前的观察结果提出新的条件,从而避免了为找到最优条件而进行的冗余评估。它基于直观的采样策略实现了高效的并行搜索,这些策略隐含地偏向于对搜索空间的探索或利用。我们的基准测试表明,与已有的优化算法相比,Phoenics对响应面的敏感性较低。我们展示了Phoenics在俄勒冈模型上的适用性,该模型是一个描述非线性化学反应网络的复杂案例研究。尽管搜索空间很大,但Phoenics能够快速确定产生期望目标动态行为的条件。总体而言,我们推荐使用Phoenics来快速优化未知的、评估成本高昂的目标函数,例如实验或长时间的计算。