Pith. sign in

REVIEW 2 cited by

An operator learning perspective on parameter-to-observable maps

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 2402.06031 v2 pith:WNOLDGSS submitted 2024-02-08 cs.LG math.STstat.MLstat.TH

classification cs.LGmath.STstat.MLstat.TH
keywords operatorlearningsolutionapproximationend-to-endfinite-dimensionalfourierfull-field
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Computationally efficient surrogates for parametrized physical models play a crucial role in science and engineering. Operator learning provides data-driven surrogates that map between function spaces. However, instead of full-field measurements, often the available data are only finite-dimensional parametrizations of model inputs or finite observables of model outputs. Building on Fourier Neural Operators, this paper introduces the Fourier Neural Mappings (FNMs) framework that is able to accommodate such finite-dimensional vector inputs or outputs. The paper develops universal approximation theorems for the method. Moreover, in many applications the underlying parameter-to-observable (PtO) map is defined implicitly through an infinite-dimensional operator, such as the solution operator of a partial differential equation. A natural question is whether it is more data-efficient to learn the PtO map end-to-end or first learn the solution operator and subsequently compute the observable from the full-field solution. A theoretical analysis of Bayesian nonparametric regression of linear functionals, which is of independent interest, suggests that the end-to-end approach can actually have worse sample complexity. Extending beyond the theory, numerical results for the FNM approximation of three nonlinear PtO maps demonstrate the benefits of the operator learning perspective that this paper adopts.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Point Cloud Neural Operator for Parametric PDEs on Complex and Variable Geometries

    math.NA 2025-01 conditional novelty 6.0 of 10

    A point cloud neural operator combining Fourier integral and least-squares gradient layers approximates PDE solution maps on variable geometries with reported test errors around 0.17 percent to 7 percent.

  2. Approximation Rates in Fr\'echet Metrics: Barron Spaces, Paley-Wiener Spaces, and Fourier Multipliers

    math.NA 2024-12 conditional novelty 5.0 of 10

    Two theorems give sufficient shallow-network width to reach a prescribed error in a Fréchet metric of semi-norms, applied to exponential spectral Barron, Gelfand-Shilov, and bandlimited (Paley-Wiener type) symbol classes.

Pith tools