The paper introduces a framework for evaluating how well learned states from neural PDE solvers can be reused in new contexts. By separating solution accuracy, learning contribution, and numerical utility through paired state comparisons and cost accounting, the authors audit 12 papers and conduct experiments on linear PDE families, Fourier neural operators, and convolutional networks. Their results show that matched state comparisons and downstream computational evidence can lead to significant savings in conjugate‑gradient iterations and demonstrate finite‑budget pretraining value.
arXiv:2606. 27354v1 Announce Type: cross Abstract: Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task: once trained, they struggle to correct their own constraint violations and extrapolate beyond the training distribution.
arXiv:2602. 06842v2 Announce Type: replace-cross Abstract: Deep learning-based hybrid iterative methods (DL-HIMs) integrate classical numerical solvers with neural operators, utilizing their complementary spectral biases to accelerate convergence.
The paper introduces a budgeted adaptive neural‑operator framework for solving time‑dependent PDEs, combining a global Fourier neural operator with a local patch‑wise residual corrector and a set‑aware selector that decides where to refine. A macro policy governs the timing and amount of refinement, and the authors propose rollout‑verified policy improvement (RV‑PI) to evaluate feasible refinement counts via actual rollouts, converting long‑horizon advantages into conservative policy targets and accepting updates only when held‑out trajectory error improves. Experiments on shallow‑water and Brusselator benchmarks show that RV‑PI outperforms immediate‑only and random macro policies, demonstrating that the value of a local correction depends on its downstream effect rather than just its immediate error reduction.
arXiv:2509. 08765v4 Announce Type: replace-cross Abstract: Data-driven acceleration of scientific computing workflows has been a high-profile aim of machine learning (ML) for science, with numerical simulation of transient partial differential equations (PDEs) being one of the main applications.
The paper investigates how different attention mechanisms affect the performance of DeepONet neural operators. Five variants—varying in cross‑attention, self‑attention, tokenization, and attention depth—are trained in both data‑driven and physics‑informed settings on one‑ and two‑dimensional PDE benchmarks. Results show that per‑sensor tokenization with cross‑attention consistently reduces error, while branch self‑attention helps only in complex spatial problems, and deeper cross‑attention yields diminishing returns with higher cost.
arXiv:2604. 07366v2 Announce Type: replace Abstract: Partial differential equations (PDEs) govern nearly every physical process in science and engineering, but solving them at scale remains prohibitively expensive.
arXiv:2602. 12706v2 Announce Type: replace Abstract: Neural operators have emerged as fast surrogate solvers for parametric partial differential equations (PDEs).
arXiv:2609.37113v1 Announce Type: new Abstract: Generalized reaction-diffusion systems encompass diverse transport mechanisms and coupled reaction kinetics. A central question for neural PDE solvers...
arXiv:2608.29448v1 Announce Type: cross Abstract: Physics-informed neural networks (PINNs) often face ill-conditioned objectives that limit high-accuracy training. Dense quasi-Newton methods improve...
arXiv:2601.12971v2 Announce Type: replace Abstract: Physics-informed neural networks (PINNs) can be limited by coordinate representations and conflicting gradients from heterogeneous physical constra...
The paper introduces a method to amortize physics-informed neural networks (PINNs) across related partial differential equations (PDEs) by explicitly modeling equation relationships in an operator graph. Coefficient vectors encode numerical parameters, while the graph hypernetwork generates diagonal codes that initialize a meta‑trained factorized PINN for each target equation. Experiments on scalar convection‑diffusion‑reaction, two‑field Fisher‑KPP, and a capacitively coupled plasma model show that term‑based descriptors and graph conditioning improve solution accuracy compared to coefficient‑vector conditioning, especially for high‑reaction and coupled systems.
Physics-Informed Neural Networks (PINNs) provide a meshless approach for solving partial differential equations (PDEs), but suffer severe degradation in stiff and shock-dominated problems, where small PDE residuals can correspond to globally inaccurate solutions. We show these failures are multi-causal, arising from the concurrent interplay of (i) spectral bias against sharp features, (ii) imbalanced multi-term optimization and loss-weight collapse, (iii) violation of temporal causality, and (iv) under-resolved collocation.