用自适应晶格多样性控制提升多晶型结构预测精度
Polymorphism Crystal Structure Prediction with Adaptive Space Group Diversity Control
- 基于多目标遗传算法,引入神经网络势能引导晶格多样性
- 在双多晶型体系中空间群与结构相似度准确率接近完美
- 适合需要高效发现新材料的计算材料学研究者
晶体材料可形成相同化学组成但不同结构(即多晶型)的相,其物理性质随合成方式或工作条件而异。例如碳可表现为石墨(软、导电)或金刚石(硬、绝缘)。能够预测这些多晶型的计算方法对材料科学至关重要,有助于理解稳定性关系、指导合成并发现具有理想性能的新材料,避免大量试错实验。然而,针对无机多晶型结构的有效晶体结构预测(CSP)算法仍十分有限。本文提出ParetoCSP2,一种结合自适应空间群多样性控制的多目标遗传算法,通过神经网络原子间势能引导种群避免单一空间群过度代表。采用改进的种群初始化与迭代结构弛豫策略,显著缓解早熟收敛问题,并加快收敛速度。结果表明,对于含两个多晶型且单元胞原子数相同的化合物,ParetoCSP2在空间群和结构相似度准确性上近乎完美。在基准数据集上,其相关准确率比基线算法高出2.46–8.62倍,常规CSP关键性能指标提升44.8%–87.04%。源代码已开源:https://github.com/usccolumbia/ParetoCSP2。
原文摘要 · Abstract (English)
Crystalline materials can form different structural arrangements (i.e. polymorphs) with the same chemical composition, exhibiting distinct physical properties depending on how they were synthesized or the conditions under which they operate. For example, carbon can exist as graphite (soft, conductive) or diamond (hard, insulating). Computational methods that can predict these polymorphs are vital in materials science, which help understand stability relationships, guide synthesis efforts, and discover new materials with desired properties without extensive trial-and-error experimentation. However, effective crystal structure prediction (CSP) algorithms for inorganic polymorph structures remain limited. We propose ParetoCSP2, a multi-objective genetic algorithm for polymorphism CSP that incorporates an adaptive space group diversity control technique, preventing over-representation of any single space group in the population guided by a neural network interatomic potential. Using an improved population initialization method and performing iterative structure relaxation, ParetoCSP2 not only alleviates premature convergence but also achieves improved convergence speed. Our results show that ParetoCSP2 achieves excellent performance in polymorphism prediction, including a nearly perfect space group and structural similarity accuracy for formulas with two polymorphs but with the same number of unit cell atoms. Evaluated on a benchmark dataset, it outperforms baseline algorithms by factors of 2.46-8.62 for these accuracies and improves by 44.8\%-87.04\% across key performance metrics for regular CSP. Our source code is freely available at https://github.com/usccolumbia/ParetoCSP2.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。