12 papers · ranked by Valyu relevance
Yifan Wu, Aron Walsh, Alex Ganose
What is the minimum number of experiments, or calculations, required to find an optimal solution? Relevant chemical problems range from identifying a compound with target functionality within a given phase space to controlling materials synthesis and device fabrication conditions. A common feature in this application…
Riley Hickman, Malcolm Sim, Sergio Pablo-García, Ivan Woolhouse + 6 more
Self-driving laboratories (SDLs) are next-generation research and development platforms for closed-loop, autonomous experimentation that combine ideas from artificial intelligence, robotics, and high-performance computing. A critical component of SDLs is the decision-making algorithm used to prioritize experiments to…
Shannon Bonke, Giovanni Trezza, Luca Bergamasco, Hongwei Song + 4 more
The sunlight-driven reduction of CO2 into fuels and platform chemicals is a promising approach to enable a circular economy. However, established optimisation approaches are poorly suited to multi-variable multi-metric photocatalytic systems because they aim to optimise one performance metric while sacrificing the…
Authors not listed
Solving optimization problems, especially for nonlinear and constrained systems, is a challenge. Decades of specialized algorithms have been developed for general and special cases of root finding, minimization (including constraints), for parameter estimation, and mapping connected spaces. These approaches typically…
Jiyizhe Zhang, Daria Semochkina, Naoto Sugisawa, David Woods + 1 more
Multi-objective Bayesian optimization (MOBO) has shown to be a promising tool for reaction development. However, noise is usually unavoidable during experiments and makes it challenging to find reliable solutions. In this study, we focus on finding a set of optimal reaction conditions using multi-objective Euclidian…
Riley Hickman, Priyansh Parakh, Austin Cheng, Qianxiang Ai + 3 more
Experiment planning algorithms are a required component of autonomous platforms for scientific discovery. Selecting a suitable optimization algorithm for a novel application is an important yet difficult choice a researcher has to make based on past empirical performance on similar tasks. To facilitate the evaluation…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Authors not listed
Experimental design plays an important role in efficiently acquiring informative data for system characterization and deriving robust conclusions under resource limitations. Recent advancements in high-throughput experimentation coupled with machine learning have notably improved experimental procedures. While Bayesian…
Pablo Quijano Velasco, Kedar Hippalgaonkar, Balamurugan Ramalingam
The discovery of optimal conditions of chemical reactions is a labor-intensive, time-consuming task that requires exploring a high-dimensional parametric space. Historically the optimization of chemical reactions has been performed by manual experimentation guided by human intuition and Design of Experiments where one…
Riley Hickman, Matteo Aldeghi, Alán Aspuru-Guzik
Model-based optimization strategies, such as Bayesian optimization (BO), have been deployed across the natural sciences in design and discovery campaigns due to their sample efficiency and flexibility. The combination of such strategies with automated laboratory equipment and/or high-performance computing in a…
Andre KY Low, Flore Mekki-Berrada, Aleksandr Ostudin, Jiaxun Xie + 7 more
The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces. To reach target properties efficiently, these platforms are increasingly paired with intelligent experimental design. When solving optimization problems, Bayesian-based optimizers are often…
Michael Hutcheon, Andrew Teale
Algorithms are presented for performing a topological analysis of an arbitrary function, evaluated on an arbitrary grid of points. These algorithms work strictly by post-processing the data and require no additional function evaluations. This is achieved by connecting the grid points with a neighbourhood graph…