Golem: an algorithm for robust experiment and process optimization

被引:22
|
作者
Aldeghi, Matteo [1 ,2 ,3 ]
Hase, Florian [1 ,2 ,3 ,4 ]
Hickman, Riley J. [2 ,3 ]
Tamblyn, Isaac [1 ,5 ]
Aspuru-Guzik, Alan [1 ,2 ,3 ,6 ]
机构
[1] Vector Inst Artificial Intelligence, Toronto, ON, Canada
[2] Univ Toronto, Dept Chem, Chem Phys Theory Grp, Toronto, ON, Canada
[3] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada
[4] Harvard Univ, Dept Chem & Chem Biol, Cambridge, MA 02138 USA
[5] Natl Res Council Canada, Ottawa, ON, Canada
[6] Canadian Inst Adv Res, Toronto, ON, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
GENETIC ALGORITHMS;
D O I
10.1039/d1sc01545a
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Numerous challenges in science and engineering can be framed as optimization tasks, including the maximization of reaction yields, the optimization of molecular and materials properties, and the fine-tuning of automated hardware protocols. Design of experiment and optimization algorithms are often adopted to solve these tasks efficiently. Increasingly, these experiment planning strategies are coupled with automated hardware to enable autonomous experimental platforms. The vast majority of the strategies used, however, do not consider robustness against the variability of experiment and process conditions. In fact, it is generally assumed that these parameters are exact and reproducible. Yet some experiments may have considerable noise associated with some of their conditions, and process parameters optimized under precise control may be applied in the future under variable operating conditions. In either scenario, the optimal solutions found might not be robust against input variability, affecting the reproducibility of results and returning suboptimal performance in practice. Here, we introduce Golem, an algorithm that is agnostic to the choice of experiment planning strategy and that enables robust experiment and process optimization. Golem identifies optimal solutions that are robust to input uncertainty, thus ensuring the reproducible performance of optimized experimental protocols and processes. It can be used to analyze the robustness of past experiments, or to guide experiment planning algorithms toward robust solutions on the fly. We assess the performance and domain of applicability of Golem through extensive benchmark studies and demonstrate its practical relevance by optimizing an analytical chemistry protocol under the presence of significant noise in its experimental conditions.
引用
收藏
页码:14792 / 14807
页数:16
相关论文
共 50 条
  • [41] Research on algorithm for system identification based on robust optimization
    Qian, Fu-Cai
    Huang, Jiao-Ru
    Qin, Xin-Qiang
    Zidonghua Xuebao/Acta Automatica Sinica, 2014, 40 (05): : 988 - 993
  • [42] An optimization based robust identification algorithm in the presence of outliers
    Bai, EW
    JOURNAL OF GLOBAL OPTIMIZATION, 2002, 23 (3-4) : 195 - 211
  • [43] A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
    Takeda, Akiko
    Taguchi, Shunsuke
    Tanaka, Tsutomu
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 47 (01) : 1 - 31
  • [44] A Nonparametric Algorithm for Optimal Stopping Based on Robust Optimization
    Sturt, Bradley
    OPERATIONS RESEARCH, 2023, 71 (05) : 1530 - 1557
  • [45] Reservoir operation using a robust evolutionary optimization algorithm
    Al-Jawad, Jafar Y.
    Tanyimboh, Tiku T.
    JOURNAL OF ENVIRONMENTAL MANAGEMENT, 2017, 197 : 275 - 286
  • [46] A Robust Accelerated Optimization Algorithm for Strongly Convex Functions
    Cyrus, Saman
    Hu, Bin
    Van Scoy, Bryan
    Lessard, Laurent
    2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC), 2018, : 1376 - 1381
  • [47] A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
    Akiko Takeda
    Shunsuke Taguchi
    Tsutomu Tanaka
    Computational Optimization and Applications, 2010, 47 : 1 - 31
  • [48] A robust algorithm for quadratic optimization under quadratic constraints
    Tuy, Hoang
    Hoai-Phuong, N. T.
    JOURNAL OF GLOBAL OPTIMIZATION, 2007, 37 (04) : 557 - 569
  • [49] A robust gradient sampling algorithm for nonsmooth, nonconvex optimization
    Burke, JV
    Lewis, AS
    Overton, ML
    SIAM JOURNAL ON OPTIMIZATION, 2005, 15 (03) : 751 - 779
  • [50] An Optimization Based Robust Identification Algorithm in the Presence of Outliers
    Er-Wei Bai
    Journal of Global Optimization, 2002, 23 : 195 - 211