Scaling Kinetic Monte-Carlo Simulations of Grain Growth with Combined Convolutional and Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNN) have emerged as a promising machine learning method for microstructure simulations such as grain growth. However, accurate modeling of realistic grain boundary networks requires large simulation cells, which GNN has difficulty scaling up to. To alleviate the computational costs and memory footprint of GNN, we propose a hybrid architecture combining a convolutional neural network (CNN) based bijective autoencoder to compress the spatial dimensions, and a GNN that evolves the microstructure in the latent space of reduced spatial sizes. Our results demonstrate that the new design significantly reduces computational costs with using fewer message passing layer (from 12 down to 3) compared with GNN alone. The reduction in computational cost becomes more pronounced as the spatial size increases, indicating strong computational scalability. For the largest mesh evaluated (160^3), our method reduces memory usage and runtime in inference by 117x and 115x, respectively, compared with GNN-only baseline. More importantly, it shows higher accuracy and stronger spatiotemporal capability than the GNN-only baseline, especially in long-term testing. Such combination of scalability and accuracy is essential for simulating realistic material microstructures over extended time scales. The improvements can be attributed to the bijective autoencoder's ability to compress information losslessly from spatial domain into a high dimensional feature space, thereby producing more expressive latent features for the GNN to learn from, while also contributing its own spatiotemporal modeling capability. The training was optimized to learn from the stochastic Potts Monte Carlo method. Our findings provide a highly scalable approach for simulating grain growth.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 53 references that are in the map. First posted on arXiv 22 Nov 2025.
Builds on
16 of 53 references.
References · 16
- 2016Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel Convolutional Neural Networkcited by 1,199
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
- 2020Learning to Simulate Complex Physics with Graph Networkscited by 867
- 2020Learning Mesh-Based Simulation with Graph Networkscited by 840
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2022Not too little, not too much: a theoretical analysis of graph (over)smoothingcited by 106
- 2022A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinkingcited by 56
- 2023Demystifying Oversmoothing in Attention-Based Graph Neural Networkscited by 47
- 2021Simple GNN Regularisation for 3D Molecular Property Prediction & Beyondcited by 44
- 2023Rethinking materials simulations: Blending direct numerical simulations with neural operatorscited by 25
- 2024GrainGNN: A dynamic graph neural network for predicting 3D grain microstructurecited by 8
4 more
- 2022Score-based denoising for atomic structure identificationcited by 7
- 2022Accelerating discrete dislocation dynamics simulations with graph neural networkscited by 5
- 2025Teaching Artificial Intelligence to Perform Rapid, Resolution-Invariant Grain Growth Modeling via Fourier Neural Operatorcited by 5
- 2023Learning dislocation dynamics mobility laws from large-scale MD simulationscited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.