Cargando…
Golem: an algorithm for robust experiment and process optimization
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 a...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
The Royal Society of Chemistry
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8597856/ https://www.ncbi.nlm.nih.gov/pubmed/34820095 http://dx.doi.org/10.1039/d1sc01545a |
_version_ | 1784600685656932352 |
---|---|
author | Aldeghi, Matteo Häse, Florian Hickman, Riley J. Tamblyn, Isaac Aspuru-Guzik, Alán |
author_facet | Aldeghi, Matteo Häse, Florian Hickman, Riley J. Tamblyn, Isaac Aspuru-Guzik, Alán |
author_sort | Aldeghi, Matteo |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-8597856 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | The Royal Society of Chemistry |
record_format | MEDLINE/PubMed |
spelling | pubmed-85978562021-11-23 Golem: an algorithm for robust experiment and process optimization Aldeghi, Matteo Häse, Florian Hickman, Riley J. Tamblyn, Isaac Aspuru-Guzik, Alán Chem Sci Chemistry 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. The Royal Society of Chemistry 2021-10-12 /pmc/articles/PMC8597856/ /pubmed/34820095 http://dx.doi.org/10.1039/d1sc01545a Text en This journal is © The Royal Society of Chemistry https://creativecommons.org/licenses/by/3.0/ |
spellingShingle | Chemistry Aldeghi, Matteo Häse, Florian Hickman, Riley J. Tamblyn, Isaac Aspuru-Guzik, Alán Golem: an algorithm for robust experiment and process optimization |
title | Golem: an algorithm for robust experiment and process optimization |
title_full | Golem: an algorithm for robust experiment and process optimization |
title_fullStr | Golem: an algorithm for robust experiment and process optimization |
title_full_unstemmed | Golem: an algorithm for robust experiment and process optimization |
title_short | Golem: an algorithm for robust experiment and process optimization |
title_sort | golem: an algorithm for robust experiment and process optimization |
topic | Chemistry |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8597856/ https://www.ncbi.nlm.nih.gov/pubmed/34820095 http://dx.doi.org/10.1039/d1sc01545a |
work_keys_str_mv | AT aldeghimatteo golemanalgorithmforrobustexperimentandprocessoptimization AT haseflorian golemanalgorithmforrobustexperimentandprocessoptimization AT hickmanrileyj golemanalgorithmforrobustexperimentandprocessoptimization AT tamblynisaac golemanalgorithmforrobustexperimentandprocessoptimization AT aspuruguzikalan golemanalgorithmforrobustexperimentandprocessoptimization |