Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEs
math.OC, cs.LG, cs.NA, math.NA, math.PR, q-fin.CP
Submitted: 2024-10-18
Updated: 2026-09-22
Comments: 47 pages + references
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Do we really need the Rademacher complexities?
- Expansion of Green's function and regularity of Robin's function for elliptic operators in divergence form
- Let data talk: data-regularized operator learning theory for inverse problems
- Global universal approximation of functional input maps on weighted spaces
- Simultaneously Solving Infinitely Many LQ Mean Field Games In Hilbert Spaces: The Power of Neural Operators
- Universal approximation theorem for neural networks with inputs from a topological vector space
- Mixtures of Neural Operators Reduce Active Complexity in Operator Learning
- Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs
- Operator Learning of Lipschitz Operators: An Information-Theoretic Perspective
- Nonlocality and Nonlinearity Implies Universality in Operator Learning
- Fourier Neural Operator for Parametric Partial Differential Equations
- DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators
- Rough paths, Signatures and the modelling of functions on streams
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
- Petrov-Galerkin operator inference with application to stability-encouraging identification