Quantitative approximation for Fourier neural operators in controlled ordinary differential equations

Fourier neural operators (FNOs) avoid the curse of parametric complexity when approximating the solution operator of certain partial differential equations (PDEs). While recent studies primarily focus on PDEs, in this article we derive upper error bounds for approximating the solution operator of controlled ordinary differential equations (CODEs) $\dot{y}=f(y,u)$ using a FNO. Under a Carathéodory setting and suitable regularity assumptions, including a smallness condition, we prove that the size of the FNO grows at most algebraically in $1/\varepsilon$, namely like $\varepsilon^{-(1+d/(2(s-1)))}$ up to logarithmic factors for GELU networks, and is thus sub-quadratic for sufficiently smooth $f$, where $d=1+n_y+n_u$ and $s$ denotes the Sobolev regularity of $f$. Our proof is based on emulating the Picard iteration through the layers of the FNO while exploiting the differentiation formula of the discrete Fourier transform. This result contributes to the quantitative approximation theory of FNOs for physically motivated problems and provides a theoretical foundation for leveraging a FNO as efficient forward surrogate for the solution operator of CODEs, especially in inverse parameter estimation where repeated evaluations of the forward operator are needed.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20883
Primary Topic
Model Reduction and Neural Networks
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantitative approximation for Fourier neural operators in controlled ordinary differential equations

Andreas Norbert Rupp, Thomas Schuster, Dean Zenner
arXiv (Cornell University)
Model Reduction and Neural Networks
preprint

Quantitative approximation for Fourier neural operators in controlled ordinary differential equations

Andreas Norbert Rupp, Thomas Schuster, Dean Zenner
preprint en

Abstract

Fourier neural operators (FNOs) avoid the curse of parametric complexity when approximating the solution operator of certain partial differential equations (PDEs). While recent studies primarily focus on PDEs, in this article we derive upper error bounds for approximating the solution operator of controlled ordinary differential equations (CODEs) $\dot{y}=f(y,u)$ using a FNO. Under a Carathéodory setting and suitable regularity assumptions, including a smallness condition, we prove that the size of the FNO grows at most algebraically in $1/\varepsilon$, namely like $\varepsilon^{-(1+d/(2(s-1)))}$ up to logarithmic factors for GELU networks, and is thus sub-quadratic for sufficiently smooth $f$, where $d=1+n_y+n_u$ and $s$ denotes the Sobolev regularity of $f$. Our proof is based on emulating the Picard iteration through the layers of the FNO while exploiting the differentiation formula of the discrete Fourier transform. This result contributes to the quantitative approximation theory of FNOs for physically motivated problems and provides a theoretical foundation for leveraging a FNO as efficient forward surrogate for the solution operator of CODEs, especially in inverse parameter estimation where repeated evaluations of the forward operator are needed.

arXiv (Cornell University)
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon