REVIEW 7 cited by
The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures
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
The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures
abstract
Operator learning, the approximation of mappings between infinite-dimensional function spaces using machine learning, has gained increasing research attention in recent years. Approximate operators, learned from data, can serve as efficient surrogate models for problems in computational science and engineering, complementing traditional methods. However, despite their empirical success, our understanding of the underlying mathematical theory is in large part still incomplete. In this paper, we study the approximation of Lipschitz operators with respect to Gaussian measures. We prove higher Gaussian Sobolev regularity of Lipschitz operators and establish lower and upper bounds on the Hermite polynomial approximation error. We then study general reconstruction strategies of Lipschitz operators from $m$ arbitrary (potentially adaptive) linear samples. As a key finding, we tightly characterize the corresponding sample complexity, that is, the smallest achievable worst-case error among all possible choices of (adaptive) sampling and reconstruction strategies in terms of $m$. As a consequence, we identify an inherent curse of sample complexity: No method to approximate Lipschitz operators based on $m$ linear samples can achieve algebraic convergence rates in $m$. On the positive side, we prove that a sufficiently fast spectral decay of the covariance operator of the underlying Gaussian measure guarantees convergence rates which are arbitrarily close to any algebraic rate. Overall, by tightly characterizing the sample complexity, our work confirms the intrinsic difficulty of learning Lipschitz operators, regardless of the data or learning technique.
Forward citations
Cited by 7 Pith papers
-
Universal, sample-optimal algorithms for recovery of anisotropic functions from i.i.d. samples
Universal nonadaptive algorithms recover anisotropic Sobolev functions near-optimally via compressed sensing on Fourier coefficients, while linear methods suffer dimension-dependent polylog penalties.
-
Transpose-free linear algebra
Establishes non-identifiability results and query lower bounds showing transpose-free matvec access provides limited information for core linear algebra tasks.
-
Cellular Sheaf Neural Operators for Structure-Preserving Surrogate Modeling of Constrained PDEs
Cellular Sheaf Neural Operators use cell complexes, learned restriction maps, and structure-aware message passing to create discretization-aware neural surrogates that preserve constraints in multiphysics PDEs such as MHD.
-
From Spectral Methods to Sample Complexity Bounds for Fourier Neural Operators
FNOs achieve polynomial sample complexity for learning time-T solution operators of dissipative evolution equations when those operators admit stable spectral discretizations, with rates depending on smoothness, dimen...
-
Efficient Approximation for Encoder--Decoder Neural Operators via Variation Spaces
Introduces variation spaces for nonlinear operators and derives dimension-independent approximation bounds of order N^{-1/2} plus encoding errors for encoder-decoder two-layer networks, yielding algebraic rates under ...
-
Upper Generalization Bounds for Neural Oscillators
Upper generalization bounds for neural oscillators scale polynomially with MLP size and time length, avoiding the curse of parametric complexity, with numerical validation on a Bouc-Wen nonlinear system.
-
A short tour of operator learning theory: Convergence rates, statistical limits, and open questions
A survey of operator learning theory showing holomorphy gives fast sample-complexity rates, general smoothness gives a polylogarithmic barrier, and FNO-approximable classes cap out at n^{-1/2}.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.