Exploiting Transformer-Based Networks and Boosting Algorithms for Ultralow Compressible Boride Design

02 January 2025, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

Ultralow compressible materials, which have high bulk modulus (K), are invaluable in extreme conditions due to their ability to undergo significant compression without structural failure. As large number of borides can be found with high K, this study develop a computational framework to scan the vast chemical space to identify the ultralow compressible borides. Transformer-based networks are helpful to generate new chemical compositions due to their self-attention mechanism, scalability, and ability to capture long-range dependencies. First, we developed a transformer-based network to generate new binary and ternary boride compositions based on the known boride compositions. Next, we trained a hybrid model based on AdaBoost and Gradient Boosting algorithms with mean absolute error (MAE) of 14.1 GPa to scan the high K borides. The CALYPSO code was used to find the possible structures for those materials. After predicting K for broad chemical domain, we found that Re-B and W-B systems are promising ultralow compressible materials. We then performed density functional theory (DFT) calculations to investigate the stability of high K materials. Our computations suggest that Re3B2, Re2B3, W5VB4, and Re5CrB4 materials exhibit K > 300 GPa with negative formation energy and energy-above-hull less than 40 meV. Those materials are mechanically and dynamically stable based on the elastic constant calculations and the phonon dispersion.

Keywords

Transformers
Borides
Bulk Modulus
Boosting Algorithms
Density Function Theory
Ultralow Compressible Materials

Supplementary materials

Title
Description
Actions
Title
Supporting Information
Description
Supporting Information includes the stiffness tensors and Born criteria for mechanical stability of the stable materials.
Actions

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.