cs.LGMay 27, 2026

Sequential Physics-Constrained Neural Operator Forward Modeling for the \textit{Norne} Reservoir System

Authors: Clement EtienamJuntao YangOleg OvcharenkoNick LuikenTsubasa OnishiNefeli MoridisIssam Said

Organizations: NVIDIA Corporation

Abstract

We develop a comprehensive mathematical and computational framework for sequential surrogate modeling of three-phase black-oil reservoir dynamics using neural operators, with particular emphasis on Fourier Neural Operators (FNO) and their physics-informed variant (PINO). The application focus is the Norne benchmark reservoir, defined on a heterogeneous 46×112×2246\times112\times22 grid (N=113,344N=113,344 cells), with a production history spanning T=30T=30 timesteps covering 3298 days. Our theoretical contributions are organized around four interlocking problems: (1) functional-analytic formulation in a product-Sobolev-space setting, including well-posedness of the implicit timestep map and sharp local Lipschitz estimates; (2) covariate shift quantification, proving that the Wasserstein-2 distance grows as W2ε(Ln1)/(L1)W_2 \leq \varepsilon(L^n-1)/(L-1), with exponential population-risk discrepancy for L>1L>1; (3) physics-constrained spectral stability, showing PINO training with λRλRλ_R \geq λ^*_R reduces the learned Jacobian spectral radius to ρF+CλR1/2ρ_F + Cλ_R^{-1/2}, yielding uniform-in-time rollout error δnε/(1ρ)|δ_n| \leq \varepsilon/(1-ρ); and (4) KK-step TBPTT gradient analysis, deriving geometric bias decay O(ρK)O(ρ^K), optimal window K=O(log(T/σ2))K^ = O(\log(T/σ^2)), and Adam convergence O(1/t)+O(ρK)O(1/\sqrt{t}) + O(ρ^{K^*}). Empirical validation confirms all theoretical predictions: autoregressive PINO surrogates sustain R2>0.99R^2>0.99 (oil), R2>0.90R^2>0.90 (gas), R20.80R^2\approx 0.80 (pressure), and monotonically improving R2R^2 (water) across the full 3298-day horizon, trained on eight NVIDIA B200 GPUs in under one hour. A 1000-member ensemble runs in under one minute on a single B200 GPU, giving a 104×{\sim}10^4\times wall-clock speedup over the OPM finite-volume simulator.

Explore similar work

Jun 16, 2026cs.LG

Operator Boosting Produces Pareto-Efficient PDE Surrogates

Neural operators are widely used as surrogate solution maps for partial differential equations (PDEs), but full-size models can be costly to store, deploy, and evaluate in many-query scientific workflows. This work introduces Operator Boosting, a stagewise residual-learning framework for constructing compact neural-operator surrogates directly, rather than training a large model and compressing it afterward. Starting from the empirical mean predictor in normalized output coordinates, the method trains a sequence of tiny same-family neural operators on residual fields and incorporates each correction through validation-selected shrinkage. We instantiate the framework with Fourier neural operators (FNOs), DeepONets, and convolutional neural operators (CNOs), and compare boosted tiny stacks against full-size monolithic baselines across one-, two-, and three-dimensional PDE benchmarks from PDEBench, APEBench, and The Well. Across 30 dataset-architecture pairs, 21 show positive mean accuracy gains and 17 have positive confidence intervals, while all boosted stacks reduce trainable parameter count by approximately 72-95%. Best-model comparisons show empirical Pareto improvements on 7 of 10 completed PDE benchmarks, including two-dimensional Navier-Stokes, shallow-water dynamics, Darcy flow, one-dimensional transport and reaction systems, and three-dimensional compressible Navier-Stokes. These results show that Operator Boosting often improves the empirical accuracy-parameter Pareto frontier of neural PDE surrogates, while also exposing PDE- and architecture-dependent regimes where residual boosting fails to offset compression.
Lennon J. Shikhman
May 10, 2026cs.LG

HS-FNO: History-Space Fourier Neural Operator for Non-Markovian Partial Differential Equations

Neural operators provide fast surrogate models for time-dependent partial differential equations, but their standard autoregressive use usually assumes that the instantaneous field u(t,)u(t,\cdot) is a complete state. This assumption fails for delay equations, distributed-memory systems, and other non-Markovian dynamics: two trajectories may agree at time tt and nevertheless have different futures because their histories differ. We introduce the History-Space Fourier Neural Operator (HS-FNO), a neural operator for delay and memory-driven PDEs formulated on the lifted state ut(θ,x)=u(t+θ,x)u_t(θ,x)=u(t+θ,x), θ[τ,0]θ\in[-τ,0]. The key computational step is to decompose one history-state update into a learned predictor for the newly exposed future slice and an exact shift-append transport for the portion of the history window already known from the previous state. This avoids learning deterministic history coordinates, reduces the learned output dimension, and enforces the natural discrete history update. We test HS-FNO on five benchmark families covering delayed reaction--diffusion, spatial epidemiology, nonlocal neural-field dynamics, delayed waves, and distributed-memory closures. Across ten random seeds, HS-FNO attains the lowest aggregate one-step, history-space, and rollout errors among the principal baselines. The largest gain occurs in autoregressive prediction, where aggregate rollout error decreases from 0.2410.241, 0.1880.188, and 0.1850.185 for current-state, lag-stack, and unconstrained history-to-history operators, respectively, to 0.0940.094. The same model uses fewer parameters than unconstrained history prediction. These results indicate that enforcing the discrete shift structure of history-state evolution is an effective inductive bias for non-Markovian PDE surrogate modeling.
Lennon J. Shikhman
Aug 30, 2026cs.LG

Sensitivity-Constrained Neural Operators for Data-Efficient Forward and Inverse Modeling of Partial Differential Equation Systems

Neural operators provide fast surrogates for partial differential equation (PDE) solvers, but their reliability can degrade for high-dimensional spatial inputs and inverse or repeated inference. State-only training constrains solution values but not the learned input--output response. We study sensitivity-constrained neural operators (SC-NOs), which augment standard training with sampled solver-derived Jacobian supervision. Selected sensitivities from differentiable solvers or discrete adjoints are matched during training, allowing response information to be amortized across minibatches without imposing the full Jacobian at every update. We evaluate SC-NO on advection--diffusion and RANS--Spalart--Allmaras benchmarks, input-dimensionality scaling tests, long-horizon autoregressive rollout, and a shallow-water Tohoku tsunami source-inversion case. Sensitivity supervision improves forward prediction and yields larger gains in gradient-based inverse reconstruction of distributed fields. Scaling experiments show an improved accuracy--cost tradeoff for high-dimensional gridded inputs, while ablations indicate that state values and Jacobian information provide complementary supervision. In the tsunami case, SC-FNO reconstructs gridded seafloor deformation from sparse early gauge observations and forecasts subsequent wave propagation in a near-real-time proof-of-concept workflow. These results support sampled sensitivity supervision as a practical way to improve neural PDE surrogates when forward accuracy, inverse stability, robustness, and computational cost must be considered together.
Abdolmehdi Behroozi, Chaopeng Shen, Daniel Kifer +1