mlsanityData to 14 Oct 2026

Arbitrary-Depth Universal Approximation Theorems for Operator Neural Networks

arXiv 2109.11354 ↗First posted 23 Sep 2021cs.LG cs.NA math.CAcited by 12

Not on the map. Why?

Abstract (arXiv)

The standard Universal Approximation Theorem for operator neural networks (NNs) holds for arbitrary width and bounded depth. Here, we prove that operator NNs of bounded width and arbitrary depth are universal approximators for continuous nonlinear operators. In our main result, we prove that for non-polynomial activation functions that are continuously differentiable at a point with a nonzero derivative, one can construct an operator NN of width five, whose inputs are real numbers with finite decimal representations, that is arbitrarily close to any given continuous nonlinear operator. We derive an analogous result for non-affine polynomial activation functions. We also show that depth has theoretical advantages by constructing operator ReLU NNs of depth 2k3+8 and constant width that cannot be well-approximated by any operator ReLU NN of depth k, unless its width is exponential in k.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 10 of its 16 references that are in the map. First posted on arXiv 23 Sep 2021.

Builds on

10 of 16 references.

References · 10

  1. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
  2. 2021Neural Operator: Learning Maps Between Function Spacescited by 414
  3. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 320
  4. 2016Benefits of depth in neural networkscited by 250
  5. 2019Universal Approximation with Deep Narrow Networkscited by 200
  6. 2015The Power of Depth for Feedforward Neural Networkscited by 183
  7. 2017Solving ill-posed inverse problems using iterative deep neural networkscited by 145
  8. 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 122
  9. 2020Neural Network Approximation: Three Hidden Layers Are Enoughcited by 63
  10. 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neuronscited by 41

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 0; 2025: 7.

12 papers.