Abstract

Predicting phase stability in high entropy alloys (HEAs), such as phase fractions as functions of composition and temperature, is essential for understanding alloy properties and screening desirable materials. Traditional methods like CALPHAD are computationally intensive for exploring high-dimensional compositional spaces. To address such a challenge, this study explored and compared the effectiveness of random forests (RF) and deep neural networks (DNN) for accelerating materials discovery by building surrogate models of phase stability prediction. For interpolation scenarios (testing on the same order of system as trained), RF models generally produce smaller errors than DNN models. However, for extrapolation scenarios (training on lower-order systems and testing on higher order systems), DNNs generalize more effectively than traditional ML models. DNN demonstrate the potential to predict topologically relevant phase composition when data were missing, making it a powerful predictive tool in materials discovery frameworks. The study uses a CALPHAD dataset of 480 million data points generated from a custom database, available for further model development and benchmarking. Experiments show that DNN models are data-efficient, achieving similar performance with a fraction of the dataset. This work highlights the potential of DNNs in materials discovery, providing a powerful tool for predicting phase stability in HEAs, particularly within the Cr-Hf-Mo-Nb-Ta-Ti-V-W-Zr composition space.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.