基于求解密度泛函理論(DFT)Kohn-Sham(KS)方程的模擬,已成為現(xiàn)代材料學(xué)和化學(xué)研究和開發(fā)組合過程的重要組成部分。盡管KS方程具有很強(qiáng)的普適性,但由于求解計(jì)算量很大,常規(guī)DFT計(jì)算一般只限于幾百個(gè)原子。
來自佐治亞理工學(xué)院的RampiRamprasad領(lǐng)導(dǎo)的團(tuán)隊(duì),報(bào)道了一種基于機(jī)器學(xué)習(xí)的方法,可以不直接求解KS方程而有效預(yù)測(cè)電子結(jié)構(gòu)。該方法利用新的旋轉(zhuǎn)不變表示,將格點(diǎn)周圍的原子環(huán)境映射到該格點(diǎn)處的電子密度和局部態(tài)密度,并使用預(yù)先計(jì)算得到的帶有幾百萬的格點(diǎn)信息的DFT結(jié)果來訓(xùn)練的神經(jīng)網(wǎng)絡(luò)來獲得該映射。上述方法可以精確模擬實(shí)際求解KS方程的結(jié)果,但是速度快幾個(gè)數(shù)量級(jí)。此外,由于該方法的計(jì)算量與系統(tǒng)尺寸嚴(yán)格成線性關(guān)系,因而有望用于大型體系的電子結(jié)構(gòu)預(yù)測(cè)。
該文近期發(fā)表于Computational Materials5:22(2019)

Solving the electronic structure problem with machine learning
Anand Chandrasekaran, Deepak Kamal, Rohit Batra, Chiho Kim, Lihua Chen & Rampi Ramprasad
Simulations based on solving the Kohn-Sham (KS) equation of density functional theory (DFT) have become a vital component of modern materials and chemical sciences research and development portfolios. Despite its versatility, routine DFT calculations are usually limited to a few hundred atoms due to the computational bottleneck posed by the KS equation. Here we introduce a machine-learning-based scheme to efficiently assimilate the function of the KS equation, and by-pass it to directly, rapidly, and accurately predict the electronic structure of a material or a molecule, given just its atomic configuration. A new rotationally invariant representation is utilized to map the atomic environment around a grid-point to the electron density and local density of states at that grid-point. This mapping is learned using a neural network trained on previously generated reference DFT results at millions of grid-points. The proposed paradigm allows for the high-fidelity emulation of KS DFT, but orders of magnitude faster than the direct solution. Moreover, the machine learning prediction scheme is strictly linear-scaling with system size.

-
電子
+關(guān)注
關(guān)注
32文章
2027瀏覽量
93659 -
機(jī)器學(xué)習(xí)
+關(guān)注
關(guān)注
66文章
8558瀏覽量
137069
原文標(biāo)題:npj: 機(jī)器學(xué)習(xí)—快速精確預(yù)測(cè)電子結(jié)構(gòu)問題
文章出處:【微信號(hào):zhishexueshuquan,微信公眾號(hào):知社學(xué)術(shù)圈】歡迎添加關(guān)注!文章轉(zhuǎn)載請(qǐng)注明出處。
發(fā)布評(píng)論請(qǐng)先 登錄
瑞薩電子AI解決方案助力優(yōu)化電子配送機(jī)器人開發(fā)
學(xué)習(xí)單片機(jī)快速方法
從數(shù)據(jù)到模型:如何預(yù)測(cè)細(xì)節(jié)距鍵合的剪切力?
機(jī)器學(xué)習(xí)和深度學(xué)習(xí)中需避免的 7 個(gè)常見錯(cuò)誤與局限性
提高條件分支指令預(yù)測(cè)正確率的方法
基于全局預(yù)測(cè)歷史的gshare分支預(yù)測(cè)器的實(shí)現(xiàn)細(xì)節(jié)
機(jī)器視覺檢測(cè)PIN針
機(jī)器視覺行業(yè)2025淺析:規(guī)模、結(jié)構(gòu)與發(fā)展趨勢(shì)
貿(mào)澤電子2025邊緣AI與機(jī)器學(xué)習(xí)技術(shù)創(chuàng)新論壇回顧(上)
FPGA在機(jī)器學(xué)習(xí)中的具體應(yīng)用
明遠(yuǎn)智睿SSD2351開發(fā)板:語音機(jī)器人領(lǐng)域的變革力量
貿(mào)澤電子2025技術(shù)創(chuàng)新論壇探討“邊緣AI與機(jī)器學(xué)習(xí)”新紀(jì)元
機(jī)器學(xué)習(xí):快速精確預(yù)測(cè)電子結(jié)構(gòu)問題
評(píng)論