aiqbench analysis
This research introduces a trainable Neural Cellular Automata framework designed to efficiently model long-term dynamics of partial differential equations, addressing the computational costs of classical solvers. By learning local update rules that mimic differential operators, the approach outperforms standard baselines like Physics-Informed Neural Networks and Fourier Neural Operators in extrapolating beyond training temporal domains. The study highlights a significant advancement in using cellular automata architectures for scientific machine learning tasks involving physical systems.
Learning PDE Time-Stepping with Neural Cellular Automata
arXiv:2608.30328v1 Announce Type: new Abstract: Classical numerical solvers for partial differential equations (PDEs) are computationally expensive to solve repeatedly across varying initial conditions, motivating the need for learned surrogates. In this paper, we propose a trainable Neural Cellular Automata (NCA) based surrogate model for learning long time PDE dynamics. Rather than mapping an entire initial field to a full trajectory in one shot, our proposed model learns a small, local, homogeneous update rule that is applied identically and repeatedly at every grid cell, mirroring the locality of differential operators. We benchmark this framework against three baselines: PDE - Net, a modified physics-informed neural network (PINN), and a Fourier Neural Operator (FNO), on five canonical PDEs (heat, advection, Burgers, Allen - Cahn, and Fisher - KPP), evaluated at temporal domain two times beyond the training temporal domain. The proposed model achieves the lowest long-horizon relative errors on the majority of the experiments.
Abstract:Classical numerical solvers for partial differential equations (PDEs) are computationally expensive to solve repeatedly across varying initial conditions, motivating the need for learned surrogates. In this paper, we propose a trainable Neural Cellular Automata (NCA) based surrogate model for learning long time PDE dynamics. Rather than mapping an entire initial field to a full trajectory in one shot, our proposed model learns a small, local, homogeneous update rule that is applied identically and repeatedly at every grid cell, mirroring the locality of differential operators. We benchmark this framework against three baselines: PDE - Net, a modified physics-informed neural network (PINN), and a Fourier Neural Operator (FNO), on five canonical PDEs (heat, advection, Burgers, Allen - Cahn, and Fisher - KPP), evaluated at temporal domain two times beyond the training temporal domain. The proposed model achieves the lowest long-horizon relative errors on the majority of the experiments.
Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2608.30328 [cs.LG]
(or arXiv:2608.30328v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.30328 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 243 words
Related coverage
Where Does Randomness Matter in Neural Cellular Automata?
arXiv · Sep 30, 2026
Reasoning with Neural Cellular Automata
arXiv · Sep 30, 2026
TextNCA: Neural Cellular Automata for Language Modeling via Hierarchical Local Attention
arXiv · Aug 5, 2026
Split-Step Dirac Cellular Automata for Continuous-Time Dirac Dynamics on Finite Spatial Lattices
arXiv · Sep 10, 2026