Optimizing telescoped heterogeneous catalysis with noise-resilient multi-objective Bayesian optimization

30 January 2024, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

This study evaluates the noise resilience of multi-objective Bayesian optimization (MOBO) algorithms in chemical synthesis, an aspect critical for processes like telescoped reactions and heterogeneous catalysis but seldom systematically assessed. Through simulation experiments on amidation, acylation, and SNAr reactions under varying noise levels, we identify the qNEHVI acquisition function as notably proficient in handling noise. Subsequently, qNEHVI is employed to optimize a two-step heterogeneous catalysis for the continuous-flow synthesis of hexafluoroisopropanol. Achieving considerable optimization within just 20 experimental runs, we report an E-factor of 0.3744 and a conversion rate of 76.20%, with optimal conditions set at 5.00 sccm and 35.00℃ for the first step, and 80.00 sccm and 170℃ for the second. This research highlights qNEHVI's potential in noisy multi-objective optimization and its practical utility in refining complex synthesis processes.

Keywords

Bayesian optimization
machine learning
telescoped synthesis
heterogeneous catalysis
hexafluoroisopropanol

Supplementary materials

Title
Description
Actions
Title
Supplementary Material
Description
The Supplementary Material provides the following content: 1. Kinetic equations for Scheme 1; 2. Numerical values for Figure 3; 3. NMR spectra and HRMS data.
Actions

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.
Comment number 1, An Su: Nov 24, 2024, 15:13

The final version of the paper has been published at https://doi.org/10.1016/j.ces.2024.120434