Neural equilibria for long-term prediction of nonlinear conservation laws
read the original abstract
Nonlinear conservation laws govern a broad class of important physical systems in science and industry and are central to scientific machine learning (SciML). Large general-purpose models offer speed, but replacing the numerical and physical structure of solvers often compromises stability, accuracy, and physical faithfulness. Here, we aim to balance the general inductive bias of conservation with the flexibility and speed of neural networks through a conservation-aware SciML backbone, which we call Neural Discrete Equilibrium (NeurDE). NeurDE places machine learning inside a kinetic solver by learning the local equilibrium closure of a Boltzmann formulation. The kinetic solver still performs transport, relaxation, moment recovery, and conservation; the neural network provides only the nonlinear equilibrium target. We test NeurDE on $6$ conserved systems, including three very challenging subsonic, transonic, and supersonic shock systems. NeurDE outperforms state-of-the-art SciML methods, including neural operators and pretrained SciML foundation models that are $10^4$ and $10^6$ times larger, respectively. Most notably, NeurDE improves upon the numerical method from which it is derived. NeurDE therefore provides a compact target for scientific machine learning in conservative simulation: learn the equilibrium law toward which the system relaxes, not the evolution law itself.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Is Flow Matching Just Trajectory Replay for Sequential Data?
Flow matching on time series targets a closed-form nonparametric velocity field that is a similarity-weighted mixture of observed transition velocities, making neural models approximations to an ideal memory-augmented...
-
SciML Agents: Write the Solver, Not the Solution
LLMs prompted with domain knowledge can generate runnable, numerically valid code for stiff and non-stiff ODEs on new diagnostic and 1000-task benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.