Fast evaluation of the adsorption energy of organic molecules on metals via graph neural networks

被引:35
|
作者
Pablo-Garcia, Sergio [1 ,2 ,3 ]
Morandi, Santiago [1 ,4 ]
Vargas-Hernandez, Rodrigo A. [2 ,5 ]
Jorner, Kjell [2 ,3 ,6 ]
Ivkovic, Zarko [1 ]
Lopez, Nuria [1 ]
Aspuru-Guzik, Alan [2 ,3 ,5 ,7 ,8 ,9 ]
机构
[1] Inst Chem Res Catalonia, Barcelona Inst Sci & Technol, Tarragona, Spain
[2] Univ Toronto, Dept Chem, Lash Miller Chem Labs, Toronto, ON, Canada
[3] Univ Toronto, Dept Comp Sci, Sandford Fleming Bldg, Toronto, ON, Canada
[4] Univ Rovira i Virgili, Dept Phys & Inorgan Chem, Tarragona, Spain
[5] Vector Inst Artificial Intelligence, Toronto, ON, Canada
[6] Chalmers Univ Technol, Dept Chem & Chem Engn, Gothenburg, Sweden
[7] Univ Toronto, Dept Mat Sci & Engn, Toronto, ON, Canada
[8] Canadian Inst Adv Res CIFAR, Toronto, ON, Canada
[9] Univ Toronto, Accelerat Consortium, Toronto, ON, Canada
来源
NATURE COMPUTATIONAL SCIENCE | 2023年 / 3卷 / 05期
基金
瑞士国家科学基金会; 瑞典研究理事会;
关键词
SCALING RELATIONS; ADDITIVITY RULES; BIG DATA; MACHINE; CHEMISORPTION;
D O I
10.1038/s43588-023-00437-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
GAME-Net is a graph deep learning model trained with small molecules containing a wide set of functional groups for predicting the adsorption energy of closed-shell organic molecules on metal surfaces, avoiding expensive density functional theory simulations. Modeling in heterogeneous catalysis requires the extensive evaluation of the energy of molecules adsorbed on surfaces. This is done via density functional theory but for large organic molecules it requires enormous computational time, compromising the viability of the approach. Here we present GAME-Net, a graph neural network to quickly evaluate the adsorption energy. GAME-Net is trained on a well-balanced chemically diverse dataset with C1-4 molecules with functional groups including N, O, S and C6-10 aromatic rings. The model yields a mean absolute error of 0.18 eV on the test set and is 6 orders of magnitude faster than density functional theory. Applied to biomass and plastics (up to 30 heteroatoms), adsorption energies are predicted with a mean absolute error of 0.016 eV per atom. The framework represents a tool for the fast screening of catalytic materials, particularly for systems that cannot be simulated by traditional methods.
引用
收藏
页码:433 / 442
页数:10
相关论文
共 50 条
  • [31] Fast approximate energy minimization via graph cuts
    Boykov, Y
    Veksler, O
    Zabih, R
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) : 1222 - 1239
  • [32] Fast transient security assessment based on graph neural networks
    Wang K.
    Mei S.
    Wei W.
    Xiao T.
    Huang S.
    Sun X.
    Dianli Xitong Baohu yu Kongzhi/Power System Protection and Control, 2023, 51 (01): : 43 - 51
  • [33] Fast Interactive Video Object Segmentation with Graph Neural Networks
    Varga, Viktor
    Lorincz, Andras
    2021 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2021,
  • [34] On Explainability of Graph Neural Networks via Subgraph Explorations
    Yuan, Hao
    Yu, Haiyang
    Wang, Jie
    Li, Kang
    Ji, Shuiwang
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [35] Graph partitioning via recurrent multivalued neural networks
    Mérida-Casermeiro, E
    López-Rodríguez, D
    COMPUTATIONAL INTELLIGENCE AND BIOINSPIRED SYSTEMS, PROCEEDINGS, 2005, 3512 : 1149 - 1156
  • [36] Streaming Graph Neural Networks via Generative Replay
    Wang, Junshan
    Zhu, Wenhao
    Song, Guojie
    Wang, Liang
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 1878 - 1888
  • [37] Streaming Graph Neural Networks via Continual Learning
    Wang, Junshan
    Song, Guojie
    Wu, Yi
    Wang, Liang
    CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 1515 - 1524
  • [38] Robust Graph Neural Networks via Ensemble Learning
    Lin, Qi
    Yu, Shuo
    Sun, Ke
    Zhao, Wenhong
    Alfarraj, Osama
    Tolba, Amr
    Xia, Feng
    MATHEMATICS, 2022, 10 (08)
  • [39] Scalable Graph Neural Networks via Bidirectional Propagation
    Chen, Ming
    Wei, Zhewei
    Ding, Bolin
    Li, Yaliang
    Yuan, Ye
    Du, Xiaoyong
    Wen, Ji-Rong
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [40] Reliable Graph Neural Networks via Robust Aggregation
    Geisler, Simon
    Zuegner, Daniel
    Guennemann, Stephan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33