Sequential Physics-Constrained Neural Operator Forward Modeling for the $\textit{Norne}$ Reservoir System
- URL: http://arxiv.org/abs/2605.28909v1
- Date: Wed, 27 May 2026 17:18:39 GMT
- Title: Sequential Physics-Constrained Neural Operator Forward Modeling for the $\textit{Norne}$ Reservoir System
- Abstract summary: We develop a comprehensive framework for sequential surrogate modeling of black-oil reservoir dynamics using neural operators.<n>The application focus is the Norne benchmark reservoir, defined on a heterogeneous $46times112times22$ grid.<n>A 1000-member ensemble runs in under one minute on a single B200 GPU, giving a $sim104times$ wall-clock speedup over the OPM finite-volume simulator.
- Score: 3.175986877079391
- License: http://creativecommons.org/licenses/by/4.0/
- 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\times112\times22$ grid ($N=113,344$ cells), with a production history spanning $T=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 $W_2 \leq \varepsilon(L^n-1)/(L-1)$, with exponential population-risk discrepancy for $L>1$; (3) physics-constrained spectral stability, showing PINO training with $λ_R \geq λ^*_R$ reduces the learned Jacobian spectral radius to $ρ_F + Cλ_R^{-1/2}$, yielding uniform-in-time rollout error $|δ_n| \leq \varepsilon/(1-ρ)$; and (4) $K$-step TBPTT gradient analysis, deriving geometric bias decay $O(ρ^K)$, optimal window $K^ = O(\log(T/σ^2))$, and Adam convergence $O(1/\sqrt{t}) + O(ρ^{K^*})$. Empirical validation confirms all theoretical predictions: autoregressive PINO surrogates sustain $R^2>0.99$ (oil), $R^2>0.90$ (gas), $R^2\approx 0.80$ (pressure), and monotonically improving $R^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 ${\sim}10^4\times$ wall-clock speedup over the OPM finite-volume simulator.
Related papers
- Fast PAC Global Optimization via Restarted Langevin: Exploration, Exploitation, and Degenerate Cooling [7.018547803286913]
Algorithm design and analysis are in continuous time.<n>Global exploration is decoupled from exploitation.<n>Experiments on the six camel and Rastrigin objectives illustrate the benefits of warmer exploration.
arXiv Detail & Related papers (2026-09-05T17:36:18Z) - Probing SMEFT Operators through $t\bar{t}t\bar{t}$ Production with Hyper-Graph Neural Networks at the LHC [0.0]
We use a Hyper-Graph Neural Network (H-GNN) to discriminate multilepton signal events from the dominant SM backgrounds.<n>In the H-GNN each event is represented as a hypergraph whose nodes correspond to reconstructed jets and leptons.<n>We project the expected sensitivity at the HL-LHC integrated luminosities of $1000mathrmfb-1$ and $3000mathrmfb-1$ with $50%$ uncertainty on the background estimation.
arXiv Detail & Related papers (2026-05-18T13:27:32Z) - QuantFPFlow: Quantum Amplitude Estimation for Fokker--Planck Policy Optimisation in Continuous Reinforcement Learning [0.2538209532048867]
We introduce textbfFPFlow, a reinforcement learning framework that integrates quantum amplitude estimation into the Fokker-Planck(FP) formulation of policy optimisation.<n>Classical continuous-space agents must estimate the FP partition function $Z = int e-V(mathbfx)/D,dmathbfx$ at cost $calO (1/varepsilon2)$; QuantFlow replaces this with a Grover-amplified amplitude estimator achieving $calO (1/varepsilon)$ -- a
arXiv Detail & Related papers (2026-05-14T18:35:38Z) - OAM-Induced Lattice Rotation Reveals a Fractional Optimum in Fault-Tolerant GKP Quantum Sensing [0.0]
We establish that orbital-angular-momentum encoding and Gottesman-Kitaev-Preskill (GKP) lattice geometry are structurally coupled.<n>Using an end-to-end differentiable Strawberry Fields--TensorFlow circuit, we jointly optimise $ell$, the lattice aspect ratio $r$, and the finite-energy envelope $$ to maximise quantum Fisher information.
arXiv Detail & Related papers (2026-05-13T09:49:16Z) - Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
arXiv Detail & Related papers (2026-03-20T01:53:44Z) - Sublinear Time Quantum Sensitivity Sampling [57.356528942341534]
We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems.<n>Our framework provides a streamlined approach for constructing coresets and offers significant runtime improvements in applications such as clustering, regression, and low-rank approximation.
arXiv Detail & Related papers (2025-09-20T20:18:49Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - Efficient Sampling of Stochastic Differential Equations with Positive
Semi-Definite Models [91.22420505636006]
This paper deals with the problem of efficient sampling from a differential equation, given the drift function and the diffusion matrix.
It is possible to obtain independent and identically distributed (i.i.d.) samples at precision $varepsilon$ with a cost that is $m2 d log (1/varepsilon)$
Our results suggest that as the true solution gets smoother, we can circumvent the curse of dimensionality without requiring any sort of convexity.
arXiv Detail & Related papers (2023-03-30T02:50:49Z) - ReSQueing Parallel and Private Stochastic Convex Optimization [59.53297063174519]
We introduce a new tool for BFG convex optimization (SCO): a Reweighted Query (ReSQue) estimator for the gradient of a function convolved with a (Gaussian) probability density.
We develop algorithms achieving state-of-the-art complexities for SCO in parallel and private settings.
arXiv Detail & Related papers (2023-01-01T18:51:29Z) - Quantum spin solver near saturation: QS$^3_{~}$ [0.0]
We develop a program package named QS$3$ [textipakj'u:-'es-kj'u:b] based on the (thick-restart) Lanczos method for analyzing spin-1/2 XXZ-type quantum spin models.
We show the benchmark results of QS$3$ for the low-energy excitation dispersion of the isotropic Heisenberg model on the $10times10times10$ cubic lattice.
arXiv Detail & Related papers (2021-07-02T07:06:34Z) - Optimal Robust Linear Regression in Nearly Linear Time [97.11565882347772]
We study the problem of high-dimensional robust linear regression where a learner is given access to $n$ samples from the generative model $Y = langle X,w* rangle + epsilon$
We propose estimators for this problem under two settings: (i) $X$ is L4-L2 hypercontractive, $mathbbE [XXtop]$ has bounded condition number and $epsilon$ has bounded variance and (ii) $X$ is sub-Gaussian with identity second moment and $epsilon$ is
arXiv Detail & Related papers (2020-07-16T06:44:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.