arXiv:2606. 28122v1 Announce Type: cross Abstract: Neural operators provide deep neural networks for learning mappings between function spaces.
arXiv:2606. 11518v1 Announce Type: cross Abstract: Fourier neural operators (FNOs) are effective and efficient surrogates for approximating solutions of PDEs and generalize across discretizations.
arXiv:2606. 00677v1 Announce Type: new Abstract: Fourier Neural Operators are often assumed to generalize across spatial resolutions, enabling training on a coarse grid and deployment on a finer grid.
arXiv:2512. 09165v2 Announce Type: replace Abstract: Deep Operator Networks (DeepONets) have emerged as a powerful framework for data-driven operator learning, providing flexible surrogates for nonlinear mappings arising in partial differential equations (PDEs).
arXiv:2608. 05892v1 Announce Type: new Abstract: Physics-informed neural networks (PINNs) often fail to accurately resolve partial differential equations (PDEs) with high-frequency or multi-scale solutions, as well as strongly nonlinear problems.
Physics-informed neural networks (PINNs) often fail to accurately resolve partial differential equations (PDEs) with high-frequency or multi-scale solutions, as well as strongly nonlinear problems. Two factors underlie this difficulty: spectral bias, the tendency of neural networks to underfit high-frequency features; and representation-coefficient coupling, the entanglement of representation learning and coefficient fitting within a single nonconvex optimization objective.
Euclidean Fourier Neural Operators (EFNOs) extend Fourier neural operators by making the spectral kernel a continuous function of physical wavevectors, thereby removing dependence on specific periodic domain shapes and sizes. This domain‑independent formulation allows EFNOs to learn operators that generalize across different grid resolutions and domain geometries. Experiments on a heat equation and a materials‑science task demonstrate that EFNOs can successfully transfer learned mappings to unseen grid sizes and crystal structures.
arXiv:2605. 31027v2 Announce Type: replace Abstract: We propose a novel neural network architecture, termed Multi-Scale Separable Fourier Neural Networks (MS-SFNN), for the accurate and efficient solution of linear and nonlinear high-frequency partial differential equations (PDEs).
arXiv:2601. 17090v2 Announce Type: replace-cross Abstract: 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.
The paper investigates when frequency decomposition aids Physics-Informed Neural Networks (PINNs) by introducing a dual‑branch, spectrally‑gated architecture (DBSG‑PINN) that separates low‑ and high‑frequency components. Experiments on five one‑dimensional PDE benchmarks show that frequency decomposition significantly reduces error—up to 59.2% on a multimodal wave problem—when the target solution is spectrally complex, but offers little improvement on smoother problems and can even worsen performance on a simple 1D wave benchmark. The adaptive gate’s effectiveness scales with the spectral richness of the solution, suggesting it exploits frequency structure rather than adding noise.
arXiv:2606. 11963v1 Announce Type: new Abstract: Neural operators provide a powerful framework for learning solution mappings of partial differential equations directly in function space.
arXiv:2602. 12706v2 Announce Type: replace Abstract: Neural operators have emerged as fast surrogate solvers for parametric partial differential equations (PDEs).
The paper introduces two multi-stage neural operator learning frameworks—Deep Collocation Neural Operator (DCNO) and Deep Galerkin Neural Operator (DGNO)—for efficiently computing convolution integrals. DCNO is a supervised method that iteratively refines operator approximations by learning residuals from data pairs, while DGNO is an unsupervised approach that uses the weak form of a PDE residual when the operator can be represented by a PDE. Both frameworks build basis operators across multiple training stages, yielding markedly higher accuracy than one-shot learning and achieving near machine‑precision results for convolution problems, with significant efficiency gains for repeated queries or parametric variations.