From Numerical Simulators of PDEs to Neural Emulators and Back

arXiv:2608.24547v1 Announce Type: new Abstract: Simulation is central to modern engineering and science, but the cost of numerical solvers for partial differential equations (PDEs) remains a bottleneck whenever fast or many-query evaluations are required. Neural emulators trained on solver-generated data promise significant speedups, yet they are usually framed as opaque alternatives to the very methods that produce their training signal. This thesis argues the two paradigms are more alike than different: neural architectures mirror classical discretizations, their errors are amenable to the same spectral analysis, and insight flows profitably in both directions. We approach the relationship by disentangling the multiple roles a solver plays in the emulator learning pipeline. Mode-wise Fourier analysis then provides a common language in which solver errors, architectural inductive biases, and training objectives can all be read off simultaneously. Taken together, this allows synthesizing three contributions. (1) APEBench, a comprehensive benchmarking suite for autoregressive neural emulators of PDEs that uses fast differentiable pseudo-spectral solvers in JAX. (2) Progressively Refined Differentiable Physics, an investigation of the effect of unconverged solvers on surrogate training. (3) Neural Emulator Superiority, an analysis of the influence of numerical errors and architectural inductive biases.

Related

• Neural Operator: Is data all you need to model the world? An insight into the paradigm of data-driven scientific ML
• Efficient Weak-Entropy PINN for Solving Hyperbolic Conservation Laws
• Physics-Informed Laplace Neural Operator for Solving Partial Differential Equations
• Compositional Neural Operators for Multi-Dimensional Fluid Dynamics
• U-HNO: A U-shaped Hybrid Neural Operator with Sparse-Point Adaptive Routing for Non-stationary PDE Dynamics

Source: arXiv cs.LG | 2026-08-26