cs.LGNov 16, 2026

TEMPO: Regime-Aware Operator Learning with Locally Adapted POD Bases

Authors: Rodion Akinzhala, Alexander Terentyev, Alexey Golubev, Yury Maximov

Abstract

Operator learning approximates the solution map of a parametric partial differential equation from data, enabling fast prediction at new parameter values without repeated simulation. The dominant approach fits a single global low-rank basis, typically a proper orthogonal decomposition (POD), to all solution snapshots. This fails when the snapshots span qualitatively different solution shapes, from smooth diffusive profiles to near-discontinuous shocks. We propose TEMPO (Trajectory Expectation-Maximization Mixture of POD Operators), a two-phase framework for regime-aware operator learning. In the offline phase, TEMPO recovers latent regimes via expectation-maximization, fitting a dedicated linear or nonlinear basis to each discovered regime. In the online phase, a gating network and per-regime branch networks are trained jointly, routing new inputs to the regimes at inference. We test TEMPO on Burgers' flow, Sod shock tubes, Coanda flow, Darcy flow, Navier-Stokes flow and the heterogeneous Helmholtz equation. With 64 total POD modes, TEMPO gives 18.61% test error on Burgers', compared with 19.61% for global POD. It also gives lower errors on Coanda and Helmholtz.

Figures & tables

Appendix figures & tables23 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Jul 7, 2026

Kernel-based Operator Learning: Error Analysis, Budget Allocation, and a Physics-Informed Extension

We study kernel-based operator learning in a two-stage sampling framework, where an offline kernel regression operator learns a discretized representation of the target operator from input-output pairs and an online kernel reconstruction operator recovers the output function from predicted observations. Our main theoretical contribution is an explicit budget allocation condition relating the number NN of training pairs, the number nn of input observations, and the output resolution mm. The condition is derived from a coupled error analysis that interprets the surrogate as a reconstruction from approximate data. This yields a decomposition of the total error into reconstruction and learning contributions that can be analyzed independently. As a consequence, we obtain quantitative scaling laws describing how NN, nn, and mm must be coupled to guarantee convergence and to balance offline learning and online reconstruction errors. The resulting estimates extend previous analyses of kernel-based operator learning. We further introduce a physics-informed extension that incorporates knowledge of the underlying PDE at evaluation time. Rather than encoding constraints directly into the kernel, we augment the online reconstruction step by penalizing PDE residuals at collocation points. The method requires no retraining for new inputs. Numerical experiments illustrate the theoretical findings and demonstrate the effectiveness of the proposed physics-informed reconstruction strategy.
May 14, 2025

Latent Evolution Operator (LEO): State-to-State Forecasting of Parametric PDEs

Solving time-dependent parametric partial differential equations (PDEs) with high-fidelity solvers is expensive in multi-query settings. This motivates reduced-order models in latent space. Existing methods are typically either (i) recurrent latent dynamics models, which require step-by-step integration and accumulate error over long horizons, or (ii) neural operators, which enable direct prediction but are usually trained from initial conditions and do not explicitly enforce generalization from intermediate states. We introduce the Latent Evolution Operator (LEO), a parameterized map that takes a state at an arbitrary time, together with physical parameters and a forecast horizon, and predicts the future state in a single latent-space evaluation. Under standard manifold and regularity assumptions, finite-time evolution operators admit an encoder-propagator-decoder decomposition. We approximate this structure using neural networks trained on state pairs sampled across anchor times and horizons. We evaluate the method on the 1D Burgers' equation, a 2D advection-diffusion system, and the shallow-water equations. The model produces accurate predictions across parameters and time horizons, achieves significant speedups compared to Autoencoder-LSTM baselines, and maintains accuracy when initialized from intermediate states. These results indicate that learning finite-time evolution operators in latent space provides an effective alternative to recurrent latent dynamics models and operator learning methods trained only from initial conditions.
Jan 23, 2026

SFO: Learning PDE Operators via Spectral Filtering

Partial differential equations (PDEs) govern complex systems, yet neural operators often struggle to efficiently capture the long-range, nonlocal interactions inherent in their solution maps. We introduce Spectral Filtering Operator (SFO), a neural operator that parameterizes integral kernels using the Universal Spectral Basis (USB), a fixed, global orthonormal basis derived from the eigenmodes of the Hilbert matrix in spectral filtering theory. Motivated by our theoretical finding that the discrete Green's functions of shift-invariant PDE discretizations exhibit spatial Linear Dynamical System (LDS) structure, we prove that these kernels admit compact approximations in the USB. By learning only the spectral coefficients of rapidly decaying eigenvalues, SFO achieves a highly efficient representation. Across six benchmarks, including reaction-diffusion, fluid dynamics, and 3D electromagnetics, SFO achieves state-of-the-art accuracy, reducing error by up to 40% relative to strong baselines while using substantially fewer parameters.