Golem: An algorithm for robust experiment and process optimization

• URL: http://arxiv.org/abs/2103.03716v1
• Date: Fri, 5 Mar 2021 15:00:34 GMT
• Title: Golem: An algorithm for robust experiment and process optimization
• Authors: Matteo Aldeghi, Florian H\"ase, Riley J. Hickman, Isaac Tamblyn, Al\'an Aspuru-Guzik
• Abstract summary: Design of experiment and optimization algorithms are often adopted to solve these tasks efficiently. Golem is an algorithm that is suboptimal to the choice of experiment planning strategy. It can be used to analyze the robustness of past experiments, or to guide experiment planning toward robust solutions on the fly.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Learning Joint Models of Prediction and Optimization [56.04498536842065]
  Predict-Then-Then framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models.
  arXiv  Detail & Related papers  (2024-09-07T19:52:14Z)
• Enhanced Bayesian Optimization via Preferential Modeling of Abstract Properties [49.351577714596544]
  We propose a human-AI collaborative Bayesian framework to incorporate expert preferences about unmeasured abstract properties into surrogate modeling. We provide an efficient strategy that can also handle any incorrect/misleading expert bias in preferential judgments.
  arXiv  Detail & Related papers  (2024-02-27T09:23:13Z)
• End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty [55.04219793298687]
  The Predict-Then-Forecast (PtO) paradigm in machine learning aims to maximize downstream decision quality. This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives. It shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.
  arXiv  Detail & Related papers  (2024-02-12T16:33:35Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• Bayesian optimization with known experimental and design constraints for chemistry applications [0.0]
  We extend our experiment planning algorithms Phoenics and Gryffin such that they can handle arbitrary known constraints. We illustrate their practical utility in two simulated chemical research scenarios.
  arXiv  Detail & Related papers  (2022-03-29T22:16:54Z)
• Constrained multi-objective optimization of process design parameters in settings with scarce data: an application to adhesive bonding [48.7576911714538]
  Finding the optimal process parameters for an adhesive bonding process is challenging. Traditional evolutionary approaches (such as genetic algorithms) are then ill-suited to solve the problem. In this research, we successfully applied specific machine learning techniques to emulate the objective and constraint functions.
  arXiv  Detail & Related papers  (2021-12-16T10:14:39Z)
• Olympus: a benchmarking framework for noisy optimization and experiment planning [0.0]
  Experiment planning strategies based on off-the-shelf optimization algorithms can be employed in fully autonomous research platforms. It is unclear how their performance would translate to noisy, higher-dimensional experimental tasks. We introduce Olympus, a software package that provides a consistent and easy-to-use framework for benchmarking optimization algorithms.
  arXiv  Detail & Related papers  (2020-10-08T17:51:51Z)
• Reactive Sample Size for Heuristic Search in Simulation-based Optimization [2.9005223064604073]
  This paper presents a novel reactive sample size algorithm based on parametric tests and indifference-zone selection. Tests employ benchmark functions extended with artificial levels of noise and a simulation-based optimization tool for hotel revenue management.
  arXiv  Detail & Related papers  (2020-05-25T14:38:55Z)
• Using models to improve optimizers for variational quantum algorithms [1.7475326826331605]
  Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization outer-loop that minimizes some function of a parameterized quantum circuit. We introduce two optimization methods and numerically compare their performance with common methods in use today.
  arXiv  Detail & Related papers  (2020-05-22T05:23:23Z)
• Incorporating Expert Prior Knowledge into Experimental Design via Posterior Sampling [58.56638141701966]
  Experimenters can often acquire the knowledge about the location of the global optimum. It is unknown how to incorporate the expert prior knowledge about the global optimum into Bayesian optimization. An efficient Bayesian optimization approach has been proposed via posterior sampling on the posterior distribution of the global optimum.
  arXiv  Detail & Related papers  (2020-02-26T01:57:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.