SR-CGCNN: Shared recurrent convolution in crystal graph neural networks for materials property prediction

Crystal graph neural networks predict materials properties by propagating information through local atomic environments. In conventional crystal graph convolutional neural networks (CGCNNs), this propagation depth is increased by stacking independently parameterized convolutional layers. This coupling between message-passing depth and parameter count raises a simple question: can repeated application of the same learned local update recover most of the benefit of a deeper CGCNN? We address this question by introducing a shared-recurrent CGCNN (SR-CGCNN), in which the main crystal-graph convolutional weights are tied across recurrent message-passing steps. The graph construction, pooling operation, and prediction head are kept unchanged, allowing a controlled comparison with standard CGCNN baselines. On Materials Project-derived formation energy and band-gap datasets, a three-step SR-CGCNN approaches the accuracy of a standard three-layer CGCNN while using only 34.5% of its trainable convolutional parameters. The formation energy test mean absolute error changes from 0.0945 to 0.0986 eV atom −1 , while the band-gap error changes from 0.4346 to 0.4503 eV. These results indicate that repeated shared message passing can provide a parameter-efficient approximation to stacked CGCNN depth, offering a compact recurrent interpretation of crystal graph convolution.

Authors

Institutions

Publication Details

Journal
Computational Materials Science
Published
2026-09-21
DOI
https://doi.org/10.1016/j.commatsci.2026.115074
Primary Topic
Machine Learning in Materials Science
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

SR-CGCNN: Shared recurrent convolution in crystal graph neural networks for materials property prediction

Satadeep Bhattacharjee
Computational Materials Science
Machine Learning in Materials Science
article

SR-CGCNN: Shared recurrent convolution in crystal graph neural networks for materials property prediction

Satadeep Bhattacharjee
article en

Abstract

Crystal graph neural networks predict materials properties by propagating information through local atomic environments. In conventional crystal graph convolutional neural networks (CGCNNs), this propagation depth is increased by stacking independently parameterized convolutional layers. This coupling between message-passing depth and parameter count raises a simple question: can repeated application of the same learned local update recover most of the benefit of a deeper CGCNN? We address this question by introducing a shared-recurrent CGCNN (SR-CGCNN), in which the main crystal-graph convolutional weights are tied across recurrent message-passing steps. The graph construction, pooling operation, and prediction head are kept unchanged, allowing a controlled comparison with standard CGCNN baselines. On Materials Project-derived formation energy and band-gap datasets, a three-step SR-CGCNN approaches the accuracy of a standard three-layer CGCNN while using only 34.5% of its trainable convolutional parameters. The formation energy test mean absolute error changes from 0.0945 to 0.0986 eV atom −1 , while the band-gap error changes from 0.4346 to 0.4503 eV. These results indicate that repeated shared message passing can provide a parameter-efficient approximation to stacked CGCNN depth, offering a compact recurrent interpretation of crystal graph convolution.

Computational Materials ScienceVol. 275
Indo Korea Science and Technology (IN)
Openalex Percentile: Top 74%
Machine Learning in Materials Science
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.