Statistical Learning Theory for Neural Operators
Niklas Reinhardt, Sven Wang, Jakob Zech

TL;DR
This paper develops statistical convergence results for learning nonlinear operators between infinite-dimensional Hilbert spaces, applying empirical process theory to neural operator architectures like FrameNet, and demonstrates algebraic convergence rates.
Contribution
It generalizes finite-dimensional nonparametric regression results to infinite-dimensional spaces and provides convergence guarantees for neural operators like FrameNet.
Findings
Proves convergence rates for least-squares estimators in infinite-dimensional settings.
Shows algebraic convergence rates for neural operators assuming holomorphicity.
Demonstrates applicability to learning solution operators of PDEs.
Abstract
We present statistical convergence results for the learning of (possibly) non-linear mappings in infinite-dimensional spaces. Specifically, given a map between two separable Hilbert spaces, we analyze the problem of recovering from noisy input-output pairs with ; here the represent randomly drawn 'design' points, and the are assumed to be either i.i.d. white noise processes or subgaussian random variables in . We provide general convergence results for least-squares-type empirical risk minimizers over compact regression classes , in terms of their approximation properties and metric entropy bounds, which are derived using empirical process techniques. This generalizes classical results from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
