Can We Formally Verify Neural PDE Surrogates? SMT Compilation of Small Fourier Neural Operators
Ali Baheri, David Millard, and Ignacio Laguna Peralta

TL;DR
This paper demonstrates how to encode Fourier Neural Operators as linear real arithmetic formulas for formal verification, balancing soundness and scalability.
Contribution
It introduces exact and approximate SMT encodings of FNOs, enabling formal guarantees and counterexamples for small PDE surrogates.
Findings
Exact encoding provides sound proofs and counterexamples for small models.
Frozen encoding scales to larger grids but loses some guarantees.
Z3 can find counterexamples better than gradient-based methods in some cases.
Abstract
Fourier Neural Operators (FNOs) can greatly accelerate PDE simulation, but they are often used without formal guarantees that they preserve basic physical structure. We show that, once the trained weights and grid are fixed, the spectral convolution in an FNO is a linear map. As a result, the full forward pass is piecewise-linear and can be represented exactly in Z3's linear real arithmetic. We study two encodings. The exact encoding compiles the spectral convolution into a dense matrix multiplication, which is sound for both proofs and counterexamples. The lighter frozen encoding replaces the spectral path with a constant, making it faster but approximate. On 10 small FNO surrogates for 1D advection-diffusion-reaction (85 to 117 parameters, grids 8 to 32), the exact encoding gives 2 sound positivity proofs on linear (ReLU-free) models, 5 sound positivity counterexamples, and 10 sound…
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.
