Race to the bottom: Bayesian optimisation for chemical problems

Yifan Wu, Aron Walsh, Alex M. Ganose

Research output: Contribution to journalReview articlepeer-review

5 Scopus citations

Abstract

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 domain is that both the dimensionality of the problems and the cost of evaluations are high. The selection of an appropriate optimisation technique is key, with standard choices including iterative (e.g. steepest descent) and heuristic (e.g. simulated annealing) approaches, which are complemented by a new generation of statistical machine learning methods. We introduce Bayesian optimisation and highlight recent success cases in materials research. The challenges of using machine learning with automated research workflows that produce small and noisy data sets are discussed. Finally, we outline opportunities for developments in multi-objective and parallel algorithms for robust and efficient search strategies.

Original languageEnglish
Pages (from-to)1086-1100
Number of pages15
JournalDigital Discovery
Volume3
Issue number6
DOIs
StatePublished - 20 May 2024

Bibliographical note

Publisher Copyright:
© 2024 RSC.

Fingerprint

Dive into the research topics of 'Race to the bottom: Bayesian optimisation for chemical problems'. Together they form a unique fingerprint.

Cite this