mlsanityData to 7 Oct 2026

Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformer

arXiv 2201.13094 ↗First posted 31 Jan 2022cs.LG cs.NE math.MGcited by 22

Not on the map. Why?

Abstract (arXiv)

Several problems in stochastic analysis are defined through their geometry, and preserving that geometric structure is essential to generating meaningful predictions. Nevertheless, how to design principled deep learning (DL) models capable of encoding these geometric structures remains largely unknown. We address this open problem by introducing a universal causal geometric DL framework in which the user specifies a suitable pair of metric spaces mathscrX and mathscrY and our framework returns a DL model capable of causally approximating any ``regular'' map sending time series in mathscrX^mathbbZ to time series in mathscrY^mathbbZ while respecting their forward flow of information throughout time. Suitable geometries on mathscrY include various (adapted) Wasserstein spaces arising in optimal stopping problems, a variety of statistical manifolds describing the conditional distribution of continuous-time finite state Markov chains, and all Fr'echet spaces admitting a Schauder basis, e.g. as in classical finance. Suitable spaces mathscrX are compact subsets of any Euclidean space. Our results all quantitatively express the number of parameters needed for our DL model to achieve a given approximation error as a function of the target map's regularity and the geometric structure both of mathscrX and of mathscrY. Even when omitting any temporal structure, our universal approximation theorems are the first guarantees that H"older functions, defined between such mathscrX and mathscrY can be approximated by DL models.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). Builds on 64 of its 167 references that are in the map. First posted on arXiv 31 Jan 2022.

Builds on

64 of 167 references.

References · 64

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  3. 2018Neural Ordinary Differential Equationscited by 3,733
  4. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  5. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  6. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 1,965
  7. 2020The power of quantum neural networkscited by 377
  8. 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
  9. 2019Continual learning with hypernetworkscited by 267
  10. 2013Fast Computation of Wasserstein Barycenterscited by 216
  11. 2019Universal Approximation with Deep Narrow Networkscited by 198
  12. 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 165
38 more
  1. 2021Neural SDEs as Infinite-Dimensional GANscited by 159
  2. 2019Neural Jump Stochastic Differential Equationscited by 147
  3. 2020Neural Rough Differential Equations for Long Time Seriescited by 140
  4. 2018Graph HyperNetworks for Neural Architecture Searchcited by 131
  5. 2016Identity Matters in Deep Learningcited by 107
  6. 2019Quant GANs: Deep Generation of Financial Time Seriescited by 107
  7. 2018Deep Hedgingcited by 106
  8. 2020Minimum Width for Universal Approximationcited by 92
  9. 2018Echo state networks are universalcited by 86
  10. 2019The phase diagram of approximation rates for deep neural networkscited by 86
  11. 2017A Random Matrix Approach to Neural Networkscited by 80
  12. 2018An elementary introduction to information geometrycited by 76
  13. 2018Small ReLU networks are powerful memorizers: a tight analysis of memorization capacitycited by 76
  14. 2020Neural Network Approximation: Three Hidden Layers Are Enoughcited by 63
  15. 2015Provable approximation properties for deep neural networkscited by 60
  16. 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
  17. 2018Universal features of price formation in financial markets: perspectives from Deep Learningcited by 59
  18. 2018A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equationscited by 55
  19. 2022HyperTransformer: Model Generation for Supervised and Semi-Supervised Few-Shot Learningcited by 55
  20. 2019Approximation spaces of deep neural networkscited by 51
  21. 2018Reservoir Computing Universality With Stochastic Inputscited by 48
  22. 2022Deep Nonparametric Estimation of Operators between Infinite Dimensional Spacescited by 45
  23. 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
  24. 2017Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systemscited by 39
  25. 2018Averaging Stochastic Gradient Descent on Riemannian Manifoldscited by 39
  26. 2021Elementary superexpressive activationscited by 35
  27. 2020A Data-driven Market Simulator for Small Data Environmentscited by 34
  28. 2020Provable Memorization via Deep Neural Networks using Sub-linear Parameterscited by 34
  29. 2021Universal Approximation Under Constraints is Possible with Transformerscited by 32
  30. 2020Fading memory echo state networks are universalcited by 31
  31. 2020Non-Euclidean Universal Approximationcited by 29
  32. 2020A generative adversarial network approach to calibration of local stochastic volatility modelscited by 28
  33. 2021Optimal Stopping via Randomized Neural Networkscited by 26
  34. 2018Stochastic Wasserstein Barycenterscited by 25
  35. 2020Discrete-time signatures and randomness in reservoir computingcited by 23
  36. 2019Generative Adversarial Networks for Financial Trading Strategies Fine-Tuning and Combinationcited by 22
  37. 2019Risk bounds for reservoir computingcited by 22
  38. 2020Robust pricing and hedging via neural SDEscited by 21

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 6; 2024: 9; 2025: 4.

22 papers.

Sort:

By area:

  1. 2023Out-of-distributional risk bounds for neural operators with applications to the Helmholtz equationcited by 32
  2. 2022Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysiscited by 22
  3. 2023Global universal approximation of functional input maps on weighted spacescited by 19
  4. 2024Mixtures of Neural Operators Reduce Active Complexity in Operator Learningcited by 16
  5. 2023A Brief Survey on the Approximation Theory for Sequence Modellingcited by 15
  6. 2022Small Transformers Compute Universal Metric Embeddingscited by 12
  7. 2022Chaotic Hedging with Iterated Integrals and Neural Networkscited by 10
  8. 2024Universal approximation results for neural networks with non-polynomial activation function over non-compact domainscited by 7
  9. 2023Memory of recurrent networks: Do we compute it right?cited by 5
  10. 2024Neural Spacetimes for DAG Representation Learningcited by 5
  11. 2024Neural Operators Can Play Dynamic Stackelberg Gamescited by 5
  12. 2023Transformers Can Solve Non-Linear and Non-Markovian Filtering Problems in Continuous Time For Conditionally Gaussian Signalscited by 3
10 more
  1. 2024Neural networks in non-metric spacescited by 3
  2. 2025One model to solve them all: 2BSDE families via neural operatorscited by 3
  3. 2024Approximation Rates and VC-Dimension Bounds for (P)ReLU MLP Mixture of Expertscited by 2
  4. 2024Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEscited by 2
  5. 2025On shallow feedforward neural networks with inputs from a topological spacecited by 2
  6. 2025Approximation Rates in Besov Norms and Sample-Complexity of Kolmogorov-Arnold Networks with Residual Connectionscited by 2
  7. 2025Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Datacited by 1
  8. 2023Generative Ornstein-Uhlenbeck Markets via Geometric Deep Learningcited by 0
  9. 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spacescited by 0
  10. 2024Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximizationcited by 0