Pith. sign in

REVIEW 4 cited by

Nonlocality and Nonlinearity Implies Universality in Operator Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.13221 v2 pith:6ULAPWET submitted 2023-04-26 math.NA cs.LGcs.NA

Nonlocality and Nonlinearity Implies Universality in Operator Learning

classification math.NA cs.LGcs.NA
keywords operatoranalysisapproximationneuralarchitecturesfourieruniversalminimal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Neural operator architectures approximate operators between infinite-dimensional Banach spaces of functions. They are gaining increased attention in computational science and engineering, due to their potential both to accelerate traditional numerical methods and to enable data-driven discovery. As the field is in its infancy basic questions about minimal requirements for universal approximation remain open. It is clear that any general approximation of operators between spaces of functions must be both nonlocal and nonlinear. In this paper we describe how these two attributes may be combined in a simple way to deduce universal approximation. In so doing we unify the analysis of a wide range of neural operator architectures and open up consideration of new ones. A popular variant of neural operators is the Fourier neural operator (FNO). Previous analysis proving universal operator approximation theorems for FNOs resorts to use of an unbounded number of Fourier modes, relying on intuition from traditional analysis of spectral methods. The present work challenges this point of view: (i) the work reduces FNO to its core essence, resulting in a minimal architecture termed the ``averaging neural operator'' (ANO); and (ii) analysis of the ANO shows that even this minimal ANO architecture benefits from universal approximation. This result is obtained based on only a spatial average as its only nonlocal ingredient (corresponding to retaining only a \emph{single} Fourier mode in the special case of the FNO). The analysis paves the way for a more systematic exploration of nonlocality, both through the development of new operator learning architectures and the analysis of existing and new architectures. Numerical results are presented which give insight into complexity issues related to the roles of channel width (embedding dimension) and number of Fourier modes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Approximation Theory of Laplacian-Based Neural Operators for Reaction-Diffusion System

    cs.LG 2026-05 unverdicted novelty 7.0

    Laplacian eigenfunction-based neural operators approximate the solution operator of the generalized Gierer-Meinhardt reaction-diffusion system with error bounds that imply only polynomial growth in parameters as accur...

  2. Adaptive Physics Transformer with Fused Global-Local Attention for Subsurface Energy Systems

    cs.LG 2026-02 conditional novelty 6.0

    APT, a mesh-agnostic neural operator fusing graph-based local features with global attention, is claimed to be the first architecture trained directly on adaptive-mesh-refinement simulations and outperforms state-of-t...

  3. Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later

    stat.ML 2025-09 unverdicted novelty 6.0

    GABI learns geometry-conditioned latent priors from multi-geometry physical response datasets for use in Bayesian inversion, yielding geometry-adapted posteriors via ABC sampling.

  4. Bulk-boundary decomposition of neural networks

    cs.LG 2025-11 reject novelty 3.0

    The paper reframes SGD training of deep networks as a local Lagrangian with data confined to the boundaries, but the advertised energy continuity equation is absent from the body.