Abstract
In this paper we prove that rectified deep neural networks do not suffer from the curse of dimensionality when approximating McKean–Vlasov SDEs in the sense that the number of parameters in the deep neural networks only grows polynomially in the space dimension d of the SDE and the reciprocal of the accuracy ϵ.
Original language | English |
---|---|
Article number | 128661 |
Journal | Journal of Mathematical Analysis and Applications |
Volume | 541 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 1 2025 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2024 Elsevier Inc.
ASJC Scopus Subject Areas
- Analysis
- Applied Mathematics
Keywords
- Complexity analysis
- Curse of dimensionality
- High-dimensional SDEs
- McKean–Vlasov SDEs
- Multilevel Picard approximation
- Rectified deep neural networks