REVIEW 2 cited by
Connectivity Optimized Nested Graph Networks for Crystal Structures
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Graph neural networks (GNNs) have been applied to a large variety of applications in materials science and chemistry. Here, we recapitulate the graph construction for crystalline (periodic) materials and investigate its impact on the GNNs model performance. We suggest the asymmetric unit cell as a representation to reduce the number of atoms by using all symmetries of the system. This substantially reduced the computational cost and thus time needed to train large graph neural networks without any loss in accuracy. Furthermore, with a simple but systematically built GNN architecture based on message passing and line graph templates, we introduce a general architecture (Nested Graph Network, NGN) that is applicable to a wide range of tasks. We show that our suggested models systematically improve state-of-the-art results across all tasks within the MatBench benchmark. Further analysis shows that optimized connectivity and deeper message functions are responsible for the improvement. Asymmetric unit cells and connectivity optimization can be generally applied to (crystal) graph networks, while our suggested nested graph framework will open new ways of systematic comparison of GNN architectures.
Forward citations
Cited by 2 Pith papers
-
CLOUD: A Scalable and Physics-Informed Foundation Model for Crystal Representation Learning
CLOUD, a BERT-style model pretrained on 6.3 million crystal structures with a new symmetry-aware string encoding (SCOPE), gives competitive property predictions and, when combined with the Debye model, extrapolates he...
-
Combining feature-based approaches with graph neural networks and symbolic regression for synergistic performance and interpretability
MatterVial combines pretrained graph-network latent features, compressed descriptors, and SISSO formulas to make MODNet competitive with state-of-the-art GNNs on MatBench with improved interpretability.
Discussion (0). Continue with ORCID to comment.