Ultra-Low-Latency Neural PDE Solvers

• Ultra-low-latency neural PDE solvers are innovative methods that compress high-dimensional fields into compact latent representations for sub-10 ms inference.
• They integrate physics-based constraints, low-rank decompositions, and temporal bundling to reduce computational complexity and enhance simulation fidelity.
• Empirical benchmarks indicate significant speedups and robust accuracy in applications such as turbulent flow control, digital twins, and uncertainty quantification.

Ultra-low-latency neural PDE solvers are a class of machine learning and hybrid-physics models designed to predict the evolution of large-scale dynamical systems governed by partial differential equations (PDEs) in real time or near-real time, with wall-clock inference latency typically below 10 milliseconds per step on modern hardware. These solvers exploit architectural innovations, latent-space modeling, reduced operator complexity, and domain-specific priors to achieve efficient spatiotemporal propagation, while preserving or surpassing the fidelity of established physics-based or neural operator approaches.

1. Latency Bottlenecks and Motivation

Standard numerical PDE solvers, including explicit/implicit finite-volume methods and classical deep learning surrogates (e.g., U-Nets, ResNets, FNOs), are constrained by high computational cost per spatiotemporal update, scaling at least linearly with the number of grid points $N$ and often much worse when global operators (e.g., FFT, full self-attention) are present. Achieving ultra-low-latency requires both (a) minimizing the number of per-step floating-point operations (FLOPs) and (b) ensuring memory/compute locality to saturate contemporary GPU/accelerator pipelines.

Latency is further constrained in applications such as:

• turbulent flow control,
• optimization-in-the-loop,
• high-fidelity digital twins,
• interactive design and uncertainty quantification.

Contemporary ultra-low-latency neural PDE solvers address these challenges by compressing computation into compact latent spaces, reducing operator complexity, and tightly integrating physical constraints at all stages of the model (Sun et al., 2023, Wang et al., 2024, Li et al., 2024, Huang et al., 2022, Bounja et al., 15 Dec 2025, Hagnberger et al., 19 May 2025, Wu et al., 2022, Wu et al., 2023, Wang et al., 27 Jan 2025, Zeng et al., 13 Oct 2025).

2. Core Model Designs and Latency-Optimized Architectures

2.1 Temporal Stencil Modeling (TSM)

TSM (Sun et al., 2023) generalizes classical finite-volume schemes (e.g., WENO) with learned, time-aware stencils. Each cell maintains a short velocity trajectory, compressed via a fixed, $O(1)$ HiPPO recurrence into a compact state, which is locally mixed by a small CNN to produce adaptive interpolation weights for explicit flux updates. Temporal bundling predicts $K$-step future weights jointly, amortizing the cost of CNN forward passes.

Key per-step complexity for a $n \times n$ grid includes:

• $O(C)$ per-cell HiPPO update,
• $O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$ for CNN evaluation ($K \sim 8$),
• $O(N_{\text{cells}} \cdot \log N_{\text{cells}})$ for FFT-based pressure projection.

On a $64^2$ configuration and a V100 GPU, TSM achieves inference latency $\sim 0.8\times$ of learned interpolation baselines while improving long-term correlation time by +19.9%.

2.2 Latent-Space Neural Operators (LNO, LNS, LE-PDE)

Latent neural operators encode the high-dimensional field into a compact representation and evolve the dynamics entirely in latent space:

• LNO (Wang et al., 2024) encodes geometric observations into a learned latent sequence via Physics-Cross-Attention (PhCA), applies $O(1)$0 transformer/self-attention layers (on $O(1)$1 tokens), and decodes outputs with a single PhCA map. Per-forward cost: $O(1)$2, typically with $O(1)$3–512 tokens.
• LNS (Li et al., 2024) trains a convolutional autoencoder + residual latent propagator, with $O(1)$4 latent grid (for $O(1)$5 fields). For 2D Navier–Stokes, LNS achieves $O(1)$6 s/iteration with $O(1)$7 rel-$O(1)$8 error, up to $O(1)$9 speed-up over UNet baselines.
• LE-PDE (Wu et al., 2022) represents state evolution by a single global latent vector, updated with a small MLP and only decoded to full fields at desired steps. This method provides up to $K$0 speedup (3D cylinder flow) and $K$1 speedup (2D Navier–Stokes) against classical and modern neural baselines for comparable accuracy.

2.3 Physics-Constrained Compression and Low-Rank Modeling (LordNet, MultiPDENet)

• LordNet (Huang et al., 2022) replaces dense per-channel fully-connected layers with extremely efficient rank-$K$2 decompositions (“Lord modules”), optimizing for Mean Squared Residual (MSR) loss on the discrete PDE. LordNet (2D, $K$3, $K$4, $K$5) runs at $K$6 ms per step, showing $K$7 speed-up over FDM-GPU with errors $K$8.
• MultiPDENet (Wang et al., 27 Jan 2025) embeds RK4 integrator blocks with learnable finite-difference convolutional stencils (6–12 parameters per block). A micro-macro time integration loop further corrects for drift, enabling $K$9–$n \times n$0 speedup (e.g., $n \times n$1 s for $n \times n$2 grid vs. $n \times n$3 s for DNS at $n \times n$4) and state-of-the-art long-horizon accuracy.

2.4 Low-Rank Attention in Large-Scale 3D PDEs (LRQ-Solver)

• LRQ-Solver (Zeng et al., 13 Oct 2025) introduces a low-rank query attention mechanism (LR-QA) reducing $n \times n$5 cost to $n \times n$6 via covariance factorization, enabling million-point 3D PDE inference in 5–8 ms. Physical conditioning is embedded globally through Parameter Conditioned Lagrangian Modeling (PCLM). With $n \times n$7, end-to-end latency is $n \times n$8 ms for $n \times n$9k points, scaling linearly up to $O(C)$0 M points within $O(C)$1 ms.

2.5 Continuous and Adaptive Convolutions (CALM-PDE)

CALM-PDE (Hagnberger et al., 19 May 2025) introduces continuous convolution operators with $O(C)$2-neighborhood constraints and adaptive query points, operating efficiently on both regular and irregular domains. The encode-process-decode loop compresses $O(C)$3 points to $O(C)$4 latent tokens, time-steps in $O(C)$5, and decodes back in $O(C)$6, achieving $O(C)$7–$O(C)$8 faster inference than transformer baselines on 2D/3D Navier–Stokes.

3. Principle Techniques for Latency Reduction

The principal design principles enabling ultra-low latency are:

1. Latent-Space Evolution: Aggressively compress state (autoencoder, PhCA, low-rank global vector) so temporal updates operate in $O(C)$9 or even $O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$0.
2. Operator Structure Compression: Replace full-grid operations (dense FC, full self-attention) with (i) low-rank decomposition (LordNet), (ii) sparse stencils (TSM, MultiPDENet), or (iii) covariance-based low-rank attention (LRQ-Solver).
3. Temporal Bundling and Multi-Step Inference: Predict multi-step trajectories or bundle weights to amortize neural evaluations over rollout windows.
4. Joint Physics Integration: Physics constraints are built into the architecture via finite-volume or finite-difference updates, Runge-Kutta integration, explicit conservation terms, or physics-informed loss functions (MSR, control-volume integrals).
5. Specialized Hardware Utilization: Methods map easily onto GPU tensor cores, saturate cache via small latent/block sizes, and leverage quantized (INT8/BF16) inference for further speedups.

4. Empirical Benchmarks and Comparisons

The following table summarizes representative latency and accuracy results across methods:

Method/Problem	Latency [ms]	Speed-up	Rel. Error	Hardware
TSM, 2D NS ($O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$1)	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$2 LI	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$3	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$4 corr. units	V100 GPU
LordNet, 2D NS ($O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$5)	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$6	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$7 vs. FDM	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$8	V100 GPU
LNO, 2D/3D PDEs	$O(N_{\text{cells}} \cdot C_{\text{net}} \cdot K)$9 faster	$K \sim 8$0–$K \sim 8$1	$K \sim 8$2	3090 GPU
LNS, 2D NS	$K \sim 8$3 (iter)	$K \sim 8$4 (vs UNet)	$K \sim 8$5	3090 GPU
LE-PDE, 2D NS ($K \sim 8$6)	$K \sim 8$7 latent/$K \sim 8$8 full	$K \sim 8$9 latent	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$0–$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$1	Quadro 8000
MultiPDENet, 2D NS	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$2 (per run)	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$3–$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$4	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$5	A100 GPU
CALM-PDE, 2D NS ($O(N_{\text{cells}} \cdot \log N_{\text{cells}})$6)	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$7 (batch 32)	$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$8–$O(N_{\text{cells}} \cdot \log N_{\text{cells}})$9	$64^2$0	A100 GPU
LRQ-Solver, 3D, $64^2$1k pts	$64^2$2	$64^2$3	$64^2$4 error $64^2$5	A100 GPU
KD-PINN, CPU (all PDEs)	$64^2$6–$64^2$7	$64^2$8–$64^2$9	$\sim 0.8\times$0 RMSE $\sim 0.8\times$1	CPU

Quantitatively, methods relying on coarse latent representations, compressed operator structure, and joint physics nets deliver end-to-end per-step wall-clock times in the few-millisecond regime, even for 3D data or batched inference.

5. Knowledge Distillation and Model Compression

The KD-PINN framework (Bounja et al., 15 Dec 2025) systematically distills large, high-accuracy teacher PDE surrogates (e.g., PINNs) into small, latency-optimized students by blending hard physics losses with soft Kullback-Leibler divergence supervision. Distilled models demonstrate sub-10 ms inference time on CPUs and $\sim 0.8\times$2–$\sim 0.8\times$3 speed-up compared to teacher PINNs, with RMSE increases $\sim 0.8\times$4 over the teacher.

The principal drivers of reduced latency are architecture compression (fewer MLP layers/neurons), reduced activation costs, kernel-launch amortization, and implicit regularization from distillation.

6. Limitations, Trade-Offs, and Applicability

Ultra-low-latency neural PDE solvers exhibit the following limitations and design considerations:

• Resolution and Mesh Topology: Most latent-space and low-rank models are optimized for regular grids; extensions to arbitrary meshes require adaptive or continuous convolution (e.g., CALM-PDE).
• Spectral and Fine-Scale Fidelity: Compression may under-resolve small-scale turbulence unless latent size is increased or multi-resolution structure is explicitly modeled.
• Physical Constraints: Data-driven models may not conserve mass/momentum unless such invariants are enforced (TSM, MultiPDENet), which is critical for long-horizon rollouts in feedback control.
• Hardware Scaling: Methods optimized for A100/H100-class GPUs may not trivially map to CPU, edge, or distributed contexts without kernel fusion and quantization.

Despite these, empirical results consistently demonstrate competitive or superior accuracy (often state-of-the-art in relative $\sim 0.8\times$5 error or long-term correlation) and strong robustness on out-of-distribution generalization (e.g., turbulence, varying Reynolds numbers) (Sun et al., 2023, Wang et al., 2024, Wang et al., 27 Jan 2025, Zeng et al., 13 Oct 2025).

7. Design Guidelines and Future Directions

• Latent Size Tuning: Set latent dimension/grid or low-rank token count to the minimum satisfying target accuracy, typically $\sim 0.8\times$6–512.
• Operator Structure: Use HiPPO/SSM recurrences for temporal compression, low-rank decompositions or Kronecker structure for global coupling, optimal CNN and local attention for mid-scale coupling.
• Physics Integration: Directly encode boundary/initial conditions, enforce conservation via PDE residual loss, and prefer architectures with physics-informed update steps.
• Hardware Execution: Leverage fused GEMM kernels, reduced-precision inference, and on-chip memory mapping for maximal throughput.

Key open directions include (a) extension to unstructured/dynamic mesh domains, (b) real-time coupling with direct numerical simulations for hybrid fidelity, (c) scalable 3D and multi-physics applications, and (d) dynamic latent representation adaptation during roll-out (Hagnberger et al., 19 May 2025, Zeng et al., 13 Oct 2025).

---

References: (Sun et al., 2023, Wang et al., 2024, Huang et al., 2022, Bounja et al., 15 Dec 2025, Hagnberger et al., 19 May 2025, Li et al., 2024, Wu et al., 2022, Wu et al., 2023, Wang et al., 27 Jan 2025, Zeng et al., 13 Oct 2025).