Abstract

Materials discovery is increasingly being impelled by machine learning methods that rely on pre-existing datasets. Where datasets are lacking, unbiased data generation can be achieved with genetic algorithms. Here a machine learning model is trained on-the-fly as a computationally inexpensive energy predictor before analyzing how to augment convergence in genetic algorithm-based approaches by using the model as a surrogate. This leads to a machine learning accelerated genetic algorithm combining robust qualities of the genetic algorithm with rapid machine learning. The approach is used to search for stable, compositionally variant, geometrically similar nanoparticle alloys to illustrate its capability for accelerated materials discovery, e.g., nanoalloy catalysts. The machine learning accelerated approach, in this case, yields a 50-fold reduction in the number of required energy calculations compared to a traditional “brute force” genetic algorithm. This makes searching through the space of all homotops and compositions of a binary alloy particle in a given structure feasible, using density functional theory calculations.

Details

Title
Genetic algorithms for computational materials discovery accelerated by machine learning
Author
Jennings, Paul C 1 ; Lysgaard Steen 2   VIAFID ORCID Logo  ; Hummelshøj, Jens Strabo 3 ; Vegge Tejs 2   VIAFID ORCID Logo  ; Bligaard, Thomas 1 

 Stanford University, SUNCAT Center for Interface Science and Catalysis, Department of Chemical Engineering, Stanford, USA (GRID:grid.168010.e) (ISNI:0000000419368956); SLAC National Accelerator Laboratory, Menlo Park, USA (GRID:grid.445003.6) (ISNI:0000 0001 0725 7771) 
 Technical University of Denmark, Department of Energy Conversion and Storage, Lyngby, Denmark (GRID:grid.5170.3) (ISNI:0000 0001 2181 8870) 
 Toyota Research Institute, Los Altos, USA (GRID:grid.5170.3) 
Publication year
2019
Publication date
2019
Publisher
Nature Publishing Group
e-ISSN
20573960
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2207142041
Copyright
© The Author(s) 2019. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.