Unsupervised machine learning to classify crystal structures according to their structural distortion: A case study on Li-argyrodite solid-state electrolytes
A. Gallo-Bueno, M. Reynaud, M. Casas-Cabanas and 1 more
Energy and AI · 2022
doi:10.1016/j.egyai.2022.100159 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
High-throughput approaches in computational materials discovery often yield a combinatorial explosion that makes the exhaustive rendering of complete structural and chemical spaces impractical. A common bottleneck when screening new compounds with archetypal crystal structures is the lack of fast and reliable decision-making schemes to quantitatively classify the computed candidates as inliers or outliers (too distorted structures). Machine learning-aided workflows can solve this problem and make geometrical optimization procedures more efficient. However, for this to occur, there is still a lack of appropriate combinations of suitable geometrical descriptors and accurate unsupervised models which are capable of accurately differentiating between systems with subtle structural changes. Here, considering as a case study the compositional screening of cubic Li-argyrodites solid electrolytes, we tackle this problem head on. We find that Steinhardt order parameters are very accurate descriptors of the cubic argyrodite structure to train a range of common unsupervised outlier detection models. And, most importantly, the approach enables us to automatically classify crystal structures with uncertainty control. The resulting models can then be used to screen computed structures with respect to an user-defined error threshold and discard too distorted structures during geometrical optimization procedures. Implemented as a decision node in computer-aided materials discovery workflows, this approach can be employed to perform autonomous high-throughput screening methods and make the use of computational and data storage resources more efficient.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.