TeaNet: universal neural network interatomic potential inspired by iterative electronic relaxations
So Takamoto, Satoshi Izumi, Ju Li

TL;DR
TeaNet is a novel graph neural network architecture that models electronic relaxation processes to create a universal interatomic potential capable of accurately predicting energies across diverse chemical systems involving elements H to Ar.
Contribution
The paper introduces TeaNet, a deep residual GCN that incorporates Euclidean tensors to represent electronic relaxation, enabling a universal potential for multiple elements and complex structures.
Findings
Achieves 19 meV/atom mean absolute error in energy predictions.
Successfully models diverse structures including molecules, metals, and amorphous materials.
Demonstrates robustness across a wide range of chemistries involving elements H to Ar.
Abstract
A universal interatomic potential for an arbitrary set of chemical elements is urgently needed in computational materials science. Graph convolution neural network (GCN) has rich expressive power, but previously was mainly employed to transport scalars and vectors, not rank tensors. As classic interatomic potentials were inspired by tight-binding electronic relaxation framework, we want to represent this iterative propagation of rank tensor information by GCN. Here we propose an architecture called the tensor embedded atom network (TeaNet) where angular interaction is translated into graph convolution through the incorporation of Euclidean tensors, vectors and scalars. By applying the residual network (ResNet) architecture and training with recurrent GCN weights initialization, a much deeper (16 layers) GCN was constructed, whose flow is similar to an iterative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsConvolution
