arXiv Machine Learning July 7, 2026 By Simone Brugiapaglia, Nicola Rares Franco, Nicholas H. Nelsen

A short tour of operator learning theory: Convergence rates, statistical limits, and open questions

Read the original on arXiv Machine Learning →

arXiv:2603. 00819v2 Announce Type: replace-cross Abstract: This paper surveys recent developments at the intersection of operator learning, statistical learning theory, and approximation theory.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 23

Theory-to-Practice Gap for Neural Networks and Neural Operators

arXiv:2503. 18219v2 Announce Type: replace Abstract: This work studies the sampling complexity of learning with ReLU neural networks and neural operators.

By Philipp Grohs, Samuel Lanthaler, Margaret Trautner

arXiv Machine Learning

Sep 15

Stochastic Gradient Descent for Operator Learning in Hilbert Spaces: Convergence Rates and Minimax Lower Bounds

arXiv:2402.04691v5 Announce Type: replace-cross Abstract: This study investigates the use of stochastic gradient descent (SGD) to learn operators between general Hilbert spaces. We study weak and str...

By Lei Shi, Jia-Qi Yang

arXiv Machine Learning

4d ago

Into the danger zone: stable extrapolation in high-dimensional function and operator learning

arXiv:2609.36709v1 Announce Type: cross Abstract: Out-of-distribution (OOD) generalization is a central challenge in scientific machine learning. We study regression problems in which the test distri...

By Ben Adcock, Simone Brugiapaglia, Xuemeng Wang

arXiv Statistics ML

6d ago

Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels

arXiv:2504.18184v5 Announce Type: replace Abstract: We consider a class of statistical inverse problems involving the estimation of a regression operator from a Polish space to a separable Hilbert sp...

By Jia-Qi Yang, Lei Shi

arXiv Machine Learning

Sep 7

The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures

The paper investigates how many linear samples are needed to learn Lipschitz operators under Gaussian measures. It establishes both lower and upper bounds on the Hermite polynomial approximation error and shows that the minimal worst‑case error cannot converge algebraically with the number of samples. However, if the covariance operator of the Gaussian measure decays rapidly, convergence rates arbitrarily close to any algebraic rate can be achieved.

By Ben Adcock, Michael Griebel, Gregor Maier

arXiv Machine Learning

2d ago

Can Domain Generalization be Guaranteed in Small-Sample Learning?

arXiv:2609.39512v1 Announce Type: new Abstract: The small-sample learning problem remains a fundamental challenge in machine learning because limited training data lead to unstable model estimation a...

By Hong Zheng

One email a morning, machine-written

Related stories

Theory-to-Practice Gap for Neural Networks and Neural Operators

Stochastic Gradient Descent for Operator Learning in Hilbert Spaces: Convergence Rates and Minimax Lower Bounds

Into the danger zone: stable extrapolation in high-dimensional function and operator learning

Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels

The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures

Can Domain Generalization be Guaranteed in Small-Sample Learning?