mlsanityData to 14 Oct 2026

Global universal approximation of functional input maps on weighted spaces

arXiv 2306.03303 ↗First posted 5 Jun 2023stat.ML cs.LG math.FAcited by 19

Not on the map. Why?

Abstract (arXiv)

We introduce so-called functional input neural networks defined on a possibly infinite dimensional weighted space with values also in a possibly infinite dimensional output space. To this end, we use an additive family to map the input weighted space to the hidden layer, on which a non-linear scalar activation function is applied to each neuron, and finally return the output via some linear readouts. Relying on Stone-Weierstrass theorems on weighted spaces, we can prove a global universal approximation result on weighted spaces for continuous functions going beyond the usual approximation on compact sets. This then applies in particular to approximation of (non-anticipative) path space functionals via functional input neural networks. As a further application of the weighted Stone-Weierstrass theorem we prove a global universal approximation result for linear functions of the signature. We also introduce the viewpoint of Gaussian process regression in this setting and emphasize that the reproducing kernel Hilbert space of the signature kernels are Cameron-Martin spaces of certain Gaussian processes. This paves a way towards uncertainty quantification for signature kernel regression.

Key facts. Cited by 19 papers in the map (data through 14 Oct 2026). Builds on 24 of its 123 references that are in the map. First posted on arXiv 5 Jun 2023.

Builds on

24 of 123 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
  3. 2021Neural Operator: Learning Maps Between Function Spacescited by 414
  4. 2021Neural SDEs as Infinite-Dimensional GANscited by 161
  5. 2017Optimal Approximation with Sparsely Connected Deep Neural Networkscited by 91
  6. 2018Echo state networks are universalcited by 87
  7. 2016Kernels for sequentially ordered datacited by 84
  8. 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
  9. 2020The Signature Kernel is the solution of a Goursat PDEcited by 58
  10. 2018Signature moments to characterize laws of stochastic processescited by 56
  11. 2021Neural Stochastic PDEs: Resolution-Invariant Learning of Continuous Spatiotemporal Dynamicscited by 47
  12. 2020A Data-driven Market Simulator for Small Data Environmentscited by 35
12 more
  1. 2020A generative adversarial network approach to calibration of local stochastic volatility modelscited by 29
  2. 2020Non-Euclidean Universal Approximationcited by 29
  3. 2020Conditional Sig-Wasserstein GANs for Time Series Generationcited by 23
  4. 2020Discrete-time signatures and randomness in reservoir computingcited by 23
  5. 2020Robust pricing and hedging via neural SDEscited by 22
  6. 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
  7. 2021Arbitrage-free neural-SDE market modelscited by 19
  8. 2021Signatured Deep Fictitious Play for Mean Field Games with Common Noisecited by 12
  9. 2022Chaotic Hedging with Iterated Integrals and Neural Networkscited by 10
  10. 2022Applications of Signature Methods to Market Anomaly Detectioncited by 9
  11. 2023Infinite-dimensional reservoir computingcited by 7
  12. 2022Convex monotone semigroups and their generators with respect to Gamma-convergencecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 7; 2025: 6; 2026: 5.

19 papers.

Sort:

By area:

  1. 2024Signature Kernel Conditional Independence Tests in Causal Discovery for Stochastic Processescited by 18
  2. 2024Lecture notes on rough paths and applications to machine learningcited by 14
  3. 2023Noncompact uniform universal approximationcited by 7
  4. 2024Universal approximation results for neural networks with non-polynomial activation function over non-compact domainscited by 7
  5. 2025Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programscited by 7
  6. 2024Solving stochastic partial differential equations using neural networks in the Wiener chaos expansioncited by 6
  7. 2025One model to solve them all: 2BSDE families via neural operatorscited by 4
  8. 2024Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approachcited by 3
  9. 2024Approximation Rates and VC-Dimension Bounds for (P)ReLU MLP Mixture of Expertscited by 2
  10. 2024Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEscited by 2
  11. 2025Universal approximation property of neural stochastic differential equationscited by 2
  12. 2025On shallow feedforward neural networks with inputs from a topological spacecited by 2
7 more
  1. 2025Global universal approximation with Brownian signaturescited by 2
  2. 2025Distributionally robust approximation property of neural networkscited by 0
  3. 2026Universality of shallow and deep neural networks on non-Euclidean spacescited by 0
  4. 2026Global universality via discrete-time signaturescited by 0
  5. 2026Universal Approximation of Nonlinear Operators and Their Derivativescited by 0
  6. 2026NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processescited by 0
  7. 2026Neural operators approximate strongly continuous convex monotone semigroupscited by 0