From Spectral Methods to Sample Complexity Bounds for Fourier Neural Operators

• URL: http://arxiv.org/abs/2607.00320v1
• Date: Wed, 01 Jul 2026 01:35:15 GMT
• Title: From Spectral Methods to Sample Complexity Bounds for Fourier Neural Operators
• Abstract summary: We introduce classes of evolution operators defined through spectral methods and derive FNO bounds for these classes.<n>For equations with nonlinearities, the learning rates depend primarily on the smoothness of the input space and the dimension of the physical domain.<n>Our results hold uniformly over broad families of dissipative equations, rather than for a single fixed PDE, and apply in particular to the Navier--Stokes, Allen--Cahn, and Cahn--Hilliard equations.
• Score: 5.169752999102176
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We establish approximation and learning guarantees for Fourier neural operators (FNOs) applied to time-$T$ solution operators of dissipative evolution equations. The analysis builds on the premise that FNOs can efficiently approximate and learn solution operators whenever these operators admit stable and accurate spectral discretizations. To formalize this idea, we introduce classes of evolution operators defined through spectral methods and derive FNO approximation bounds and polynomial sample complexity guarantees for these classes. For equations with polynomial nonlinearities, the learning rates depend primarily on the smoothness of the input space and the dimension of the physical domain. Our results hold uniformly over broad families of dissipative equations, rather than for a single fixed PDE, and apply in particular to the Navier--Stokes, Allen--Cahn, and Cahn--Hilliard equations. For equations with non-polynomial smooth nonlinearities, we prove that polynomial sample complexity still holds with rates that now additionally depend on the smoothness of the nonlinear terms and the dissipation strength. Overall, we connect classical spectral approximation theory with modern operator learning and explain when FNOs can learn nonlinear evolution operators efficiently.

Related papers

• Joint Spatiotemporal Spectral Neural Operators for Learning PDEs on Irregular Domains [2.8647133890966994]
  We introduce the textbfGraph Spectral Neural Operator (GSNO), a neural operator that combines spatial graph spectral decompositions with temporal Fourier transforms.<n>GSNO enables globally coherent operator learning on non-Cartesian discretizations without domain warping or autoregressive rollouts.<n>It achieves strong accuracy with reduced runtime and parameter counts, while demonstrating robust zero-shot generalization across mesh resolutions and geometry families.
  arXiv  Detail & Related papers  (2026-08-30T16:41:10Z)
• Random Neural Network Expressivity for Non-Linear Partial Differential Equations [6.623217355591568]
  We study RaNN expressivity for learning solutions to non-linear partial differential equations.<n>We show that RaNNs are capable of efficiently approximating solutions to complex, non-linear PDEs.
  arXiv  Detail & Related papers  (2026-05-24T13:08:34Z)
• Linear-Nonlinear Fusion Neural Operator for Partial Differential Equations [4.892307363245757]
  We find that explicitly decoupling linear and nonlinear effects within operator mappings leads to markedly improved learning efficiency.<n>This yields a novel network structure, namely the Linear-Nonlinear Fusion Neural Operator (LNF-NO)<n>LNF-NO naturally supports multiple functional inputs and is applicable to both regular grids and irregular geometries.
  arXiv  Detail & Related papers  (2026-03-25T10:10:53Z)
• NeuraLSP: An Efficient and Rigorous Neural Left Singular Subspace Preconditioner for Conjugate Gradient Methods [49.84495044725856]
  NeuraLSP is a novel neural preconditioner combined with a novel loss metric.<n>Our method exhibits both theoretical guarantees and empirical robustness to rank inflation, up to a 53% speedup.
  arXiv  Detail & Related papers  (2026-01-28T02:15:16Z)
• PTL-PINNs: Perturbation-Guided Transfer Learning with Physics- Informed Neural Networks for Nonlinear Systems [7.961515776672606]
  We propose a perturbation-guided transfer learning framework for PINNs (PTL-PINN)<n>PTL-PINNs solve an approximate linear perturbative system using closed-form expressions, enabling rapid generalization with the time complexity of matrix-vector multiplication.<n>We show that PTL-PINNs achieve accuracy comparable to various Runge-Kutta methods, with computational speeds up to one order of magnitude faster.
  arXiv  Detail & Related papers  (2026-01-17T16:09:33Z)
• Fourier Neural Operators Explained: A Practical Perspective [75.12291469255794]
  The Fourier Neural Operator (FNO) has become the most influential and widely adopted due to its elegant spectral formulation.<n>This guide aims to establish a clear and reliable framework for applying FNOs effectively across diverse scientific and engineering fields.
  arXiv  Detail & Related papers  (2025-12-01T08:56:21Z)
• Spectral operator learning for parametric PDEs without data reliance [6.7083321695379885]
  We introduce a novel operator learning-based approach for solving parametric partial differential equations (PDEs) without the need for data harnessing. The proposed framework demonstrates superior performance compared to existing scientific machine learning techniques.
  arXiv  Detail & Related papers  (2023-10-03T12:37:15Z)
• Non-Parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence [65.63201894457404]
  We propose a novel non-parametric learning paradigm for the identification of drift and diffusion coefficients of non-linear differential equations.<n>The key idea essentially consists of fitting a RKHS-based approximation of the corresponding Fokker-Planck equation to such observations.
  arXiv  Detail & Related papers  (2023-05-24T20:43:47Z)
• FC-PINO: High Precision Physics-Informed Neural Operators via Fourier Continuation [60.706803227003995]
  We introduce the FC-PINO (Fourier-Continuation-based PINO) architecture which extends the accuracy and efficiency of PINO to non-periodic and non-smooth PDEs.<n>We demonstrate that standard PINO struggles to solve non-periodic and non-smooth PDEs with high precision, across challenging benchmarks.<n>In contrast, the proposed FC-PINO provides accurate, robust, and scalable solutions, substantially outperforming PINO alternatives.
  arXiv  Detail & Related papers  (2022-11-29T06:37:54Z)
• Semi-supervised Learning of Partial Differential Operators and Dynamical Flows [68.77595310155365]
  We present a novel method that combines a hyper-network solver with a Fourier Neural Operator architecture. We test our method on various time evolution PDEs, including nonlinear fluid flows in one, two, and three spatial dimensions. The results show that the new method improves the learning accuracy at the time point of supervision point, and is able to interpolate and the solutions to any intermediate time.
  arXiv  Detail & Related papers  (2022-07-28T19:59:14Z)
• Feature Engineering with Regularity Structures [4.082216579462797]
  We investigate the use of models from the theory of regularity structures as features in machine learning tasks. We provide a flexible definition of a model feature vector associated to a space-time signal, along with two algorithms which illustrate ways in which these features can be combined with linear regression. We apply these algorithms in several numerical experiments designed to learn solutions to PDEs with a given forcing and boundary data.
  arXiv  Detail & Related papers  (2021-08-12T17:53:47Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.