Skip to content

Learning PDE Time-Stepping with Neural Cellular Automata

Aug 2026 · 0 citations · 25 references
Computer Science Mathematics

TL;DR

This paper proposes a trainable Neural Cellular Automata (NCA) based surrogate model for learning long time PDE dynamics that 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.

View source

Similar papers

Preprint Aug 2026

One-Step Evolution for Long-Time Extrapolation: An Error-Bound-Informed and Prior-Guided Neural Residual Framework for Autonomous PDEs

A numerical-prior-guided, physics-constrained method trained without ground-truth trajectory supervision that reduces long-time extrapolation error relative to the numerical prior and outperforms the best competing baseline in each case, thereby improving long-time simulation accuracy across different PDEs without grou...

Ma-Qun Zhang, Feng Gao, Wan-Kun Chen et al. · 0 citations
Preprint Sep 2026

TASE-Stabilized Time-Evolving Natural Gradient Methods for Diffusion-Dominated PDEs

The Time-Evolving Natural Gradient (TENG) method evolves neural approximations of time-dependent partial differential equations by projecting time-discrete target states onto the neural-network manifold through local natural-gradient iterations. For stiff diffusion-dominated problems, however, explicit Runge--Kutta met...

Zi-Hao Shi, Dong-Ling Wang · 0 citations
Open access Oct 2026

Learning approximate solutions of partial differential equations within the physics-informed framework

Variants of physics-informed neural networks (PINNs) often treat neural networks as the main solution representation, yet solutions are encoded implicitly in high-dimensional weights, making training behavior and outcomes difficult to predict or analyze across different partial differential equation (PDE) settings. I...

Kai-Wei Cong, Shuang-Qing Chen, Bing Guan · 0 citations
#machine learning Preprint Oct 2026

Simulation-Free Learning of Population Dynamics with Wasserstein Lagrangian Residuals

The dynamics of cells, organisms, and fluids are often modeled as probability distributions evolving over time. Reconstructing and extrapolating this evolution from unpaired snapshots requires assumptions about the underlying process. Wasserstein gradient flows are a common choice, but they cannot describe conservative...

F. Sergeev, Markus Heinonen, Daniel Waxman et al. · 0 citations
#machine learning Preprint Sep 2026

Warm-starting PDE solvers with any-dimensional machine learning

Any-dimensional machine learning models, such as graph neural networks (GNNs), can be naturally trained and evaluated on inputs of different sizes and dimensions. Inspired by the GNN transferability literature, we show mathematical conditions under which a partial differential equation (PDE) learning-based solver can b...

Wilson G. Gregory, G. Kevrekidis, Ben Blum-Smith et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.