Rectified deep neural networks overcome the curse of dimensionality when approximating solutions of McKean–Vlasov stochastic differential equations

Ariel Neufeld*, Tuan Anh Nguyen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Article number128661
JournalJournal of Mathematical Analysis and Applications
Volume541
Issue number1
DOIs
Publication statusPublished - Jan 1 2025
Externally publishedYes

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

Fingerprint

Dive into the research topics of 'Rectified deep neural networks overcome the curse of dimensionality when approximating solutions of McKean–Vlasov stochastic differential equations'. Together they form a unique fingerprint.

Cite this