mlsanityData to 14 Oct 2026

Universal Time-Uniform Trajectory Approximation for Random Dynamical Systems with Recurrent Neural Networks

arXiv 2211.08018 ↗First posted 15 Nov 2022cs.NE cs.LG math.DScited by 1

Not on the map. Why?

Abstract (arXiv)

The capability of recurrent neural networks to approximate trajectories of a random dynamical system, with random inputs, on non-compact domains, and over an indefinite or infinite time horizon is considered. The main result states that certain random trajectories over an infinite time horizon may be approximated to any desired accuracy, uniformly in time, by a certain class of deep recurrent neural networks, with simple feedback structures. The formulation here contrasts with related literature on this topic, much of which is restricted to compact state spaces and finite time intervals. The model conditions required here are natural, mild, and easy to test, and the proof is very simple.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 73 references that are in the map. First posted on arXiv 15 Nov 2022.

Builds on

21 of 73 references.

References · 21

  1. 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 415
  2. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 320
  3. 2016Benefits of depth in neural networkscited by 250
  4. 2018Sorting out Lipschitz function approximationcited by 213
  5. 2019Universal Approximation with Deep Narrow Networkscited by 200
  6. 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 166
  7. 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 122
  8. 2020Minimum Width for Universal Approximationcited by 94
  9. 2019Deep Neural Network Approximation Theorycited by 93
  10. 2018Echo state networks are universalcited by 87
  11. 2013How to Construct Deep Recurrent Neural Networkscited by 64
  12. 2018Limitations of the Lipschitz constant as a defense against adversarial examplescited by 49
9 more
  1. 2018Reservoir Computing Universality With Stochastic Inputscited by 48
  2. 2017Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systemscited by 39
  3. 2020Fading memory echo state networks are universalcited by 32
  4. 2022Approximation of Lipschitz Functions using Deep Spline Neural Networkscited by 15
  5. 2019Universal Lipschitz Approximation in Bounded Depth Neural Networkscited by 11
  6. 2020Learning Recurrent Neural Net Models of Nonlinear Systemscited by 11
  7. 2019Approximation capabilities of neural networks on unbounded domainscited by 7
  8. 2020Lipschitz neural networks are dense in the set of all Lipschitz functionscited by 6
  9. 2022Recurrent Neural Networks and Universal Approximation of Bayesian Filterscited by 5

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.