Latent Generative Solvers for Generalizable Long-Term Physics Simulation
Zituo Chen, Sili Deng

TL;DR
This paper introduces the Latent Generative Solver (LGS), a neural PDE solver that generalizes across multiple PDE families and maintains stability over long-term autoregressive rollouts.
Contribution
LGS combines a shared latent manifold, a flow-matching transformer, and input noising to achieve long-term stability and cross-family generalization in physics simulations.
Findings
LGS matches deterministic baselines at one step and outperforms on 15/16 systems at longer horizons.
Reduces 20-step L2RE from 56.1% to 30.2%.
Adapts efficiently to unseen PDEs, significantly improving error after fine-tuning.
Abstract
Reliable physics simulation demands two capabilities that today's neural PDE solvers do not deliver together: generalization across heterogeneous PDE families, and stability under long autoregressive rollouts. Deterministic operators accumulate error geometrically, while existing probabilistic solvers are confined to a single PDE family or short horizons. We close this gap with the \textbf{Latent Generative Solver} (LGS), three coupled components: (i) a Physics VAE (PhyVAE) compressing twelve PDE families into a shared latent manifold; (ii) a Pyramidal Flow-Forcing Transformer (PFlowFT) that generates the next latent by flow matching, conditioned on a per-trajectory context updated on the model's own predictions; and (iii) input noising during training, for which we derive a sufficient-condition contraction bound explaining the observed long-horizon stability. Pretrained on a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
