cs.LGAug 23, 2026

Helix-FNO: Spectral-Domain Operator Learning Coupled with a High-Fidelity Mechanistic Model for Fast Surrogate Simulation

Authors: Jiabao Zhao, Chuwei Wang, Jinxi Yang

Organizations: University of Science and Technology Liaoning Anshan, Liaoning, China · Wuhan University Wuhan, Hubei, China

Abstract

Mechanistic simulation models of full-scale treatment processes remain the only trustworthy, extrapolative description of the underlying physico-chemical dynamics, yet their runtime is far too slow to support the thousands of forward evaluations that a modern decision engine requires at a 5-minute decision cadence. The standard remedy-surrogate modelling-often produces a network that learns a single solution for a single configuration, so it generalises poorly to new influent profiles, control settings or plant layouts. This paper presents Helix-FNO, a teacher-student architecture that couples a thirty-two-state mechanistic teacher with a Fourier neural operator (FNO) student. The teacher supplies a high-fidelity dataset of input-field-to-solution pairs, curated by Latin-hypercube and uncertainty-based active learning to cover the boundary and overload regimes that matter in practice; the student learns, in the spectral domain, the solution operator itself rather than any single solution, thereby moving from learning one instance to learning an entire family of equations. We give the operator formulation, the spectral convolution definition, the weighted distillation loss and the active-learning criterion, and we analyse the approximation error of a truncated Fourier expansion with respect to the smoothness of the parametric solution manifold. An illustrative study compares Helix-FNO against a physics-informed network and a data-driven recurrent surrogate on accuracy, dataset efficiency and inference latency, and places the methods on a speed-accuracy Pareto front. The resulting operator is three orders of magnitude faster than the mechanistic teacher at millisecond inference, which is precisely the capability required for massive candidate screening and online decision support.

Figures & tables

Explore similar work

Jun 9, 2026

SirenFNO: Efficient and Full Frequency Learning of Fourier Neural Operators

Fourier neural operators (FNOs) are effective and efficient surrogates for approximating solutions of PDEs and generalize across discretizations. However, owing to the reliance on frequency truncation to maintain learning efficiency of FNOs, empirical studies suggest that FNOs exhibit spectral bias toward low-frequency information, which may hinder the learning capability especially for certain PDEs with strong high-frequency oscillations. To address this limitation, we propose SirenFNO, a novel framework that leverages sinusoidal representation networks (SIRENs) to learn implicit neural representations and performs mode-wise kernel parameterization. Our SIREN parameterization learns a full-grid spectrum with a constant and discretization-independent parameter count, thereby eliminating the need for frequency truncation. We further extend SirenFNO with functional tensor decompositions to enhance parameter and learning efficiency. Empirical results show that our SirenFNO consistently outperforms FNO with approximately 44 to 1515 times parameter reductions with preserved discretization invariance, and our functional decomposition variants obtain performance improvements with a maximum of 7373 times fewer parameters across multiple PDE benchmarks.
May 27, 2026

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

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≤ε(Ln−1)/(L−1)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λR−1/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), R2≈0.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.
May 10, 2026

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.