mlsanityData to 7 Oct 2026

Approximation properties of neural ODEs

arXiv 2503.15696 ↗First posted 19 Mar 2025math.NA cs.LG cs.NAcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the approximation properties of neural ordinary differential equations (neural ODEs) in the space of continuous functions. Since a neural ODE requires input and output dimensions to be the same, while input and output dimensions of a continuous function are generally different, we need to embed an input into the latent space of the neural ODE, and to project the output of the neural ODE into the output space. By composing the neural ODE flow map with such embedding and projection operations, we get a shallow neural network whose activation function is defined as the flow map of the neural ODE at the final time of the integration interval. Thus, the study of the approximation properties of neural ODEs leads to the study of the approximation properties of shallow neural networks with a particular choice of activation function. We prove the universal approximation property (UAP) of such shallow neural networks in the space of continuous functions. Furthermore, we investigate the approximation properties of shallow neural networks whose parameters satisfy specific constraints. In particular, we constrain the Lipschitz constant of the neural ODE's flow map and the norms of the weights to increase the network's stability. We prove that the UAP holds if we consider either constraint independently. When both are enforced, there is a loss of expressiveness, and we derive approximation bounds that quantify how accurately such a constrained network can approximate a continuous function.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 56 references that are in the map. First posted on arXiv 19 Mar 2025.

Builds on

35 of 56 references.

References · 35

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2013Intriguing properties of neural networkscited by 5,114
  5. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
  6. 2018Neural Ordinary Differential Equationscited by 3,733
  7. 2022Elucidating the Design Space of Diffusion-Based Generative Modelscited by 2,994
  8. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  9. 2020HiPPO: Recurrent Memory with Optimal Polynomial Projectionscited by 600
  10. 2016Error bounds for approximations with deep ReLU networkscited by 567
  11. 2017Stable Architectures for Deep Neural Networkscited by 340
  12. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
23 more
  1. 2021GRAND: Graph Neural Diffusioncited by 258
  2. 2019Universal Approximation with Deep Narrow Networkscited by 198
  3. 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 176
  4. 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 165
  5. 2020Deep Network Approximation for Smooth Functionscited by 163
  6. 2016Why and When Can Deep -- but Not Shallow -- Networks Avoid the Curse of Dimensionality: a Reviewcited by 155
  7. 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 120
  8. 2019Deep Network Approximation Characterized by Number of Neuronscited by 120
  9. 2021Optimal Approximation Rate of ReLU Networks in terms of Width and Depthcited by 95
  10. 2020Minimum Width for Universal Approximationcited by 92
  11. 2019The phase diagram of approximation rates for deep neural networkscited by 86
  12. 2020Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependenciescited by 81
  13. 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
  14. 2020The troublesome kernel -- On hallucinations, no free lunches and the accuracy-stability trade-off in inverse problemscited by 40
  15. 2018Deep, Skinny Neural Networks are not Universal Approximatorscited by 37
  16. 2020Structure preserving deep learningcited by 30
  17. 2022Achieve the Minimum Width of Neural Networks for Universal Approximationcited by 25
  18. 2021Approximation capability of two hidden layer feedforward neural networks with fixed weightscited by 24
  19. 2017On the approximation by single hidden layer feedforward neural networks with fixed weightscited by 19
  20. 2023From Coupled Oscillators to Graph Neural Networks: Reducing Over-smoothing via a Kuramoto Model-based Approachcited by 15
  21. 2020Approximation in shift-invariant spaces with deep ReLU neural networkscited by 12
  22. 2024Contractivity of neural ODEs: an eigenvalue optimization problemcited by 4
  23. 2025Improving the robustness of neural ODEs with minimal weight perturbationcited by 4

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.