PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 6, 2021Constructive Approximation96 citationsOpen Access

DNN Expression Rate Analysis of High-Dimensional PDEs: Application to Option Pricing

DEDennis ElbrächterPGPhilipp GrohsAJArnulf Jentzen

Key Points

Key points are not available for this paper at this time.

Abstract

Abstract We analyze approximation rates by deep ReLU networks of a class of multivariate solutions of Kolmogorov equations which arise in option pricing. Key technical devices are deep ReLU architectures capable of efficiently approximating tensor products. Combining this with results concerning the approximation of well-behaved (i. e. , fulfilling some smoothness properties) univariate functions, this provides insights into rates of deep ReLU approximation of multivariate functions with tensor structures. We apply this in particular to the model problem given by the price of a European maximum option on a basket of d assets within the Black–Scholes model for European maximum option pricing. We prove that the solution to the d -variate option pricing problem can be approximated up to an ε -error by a deep ReLU network with depth {O} ( (d) (^-1) + (d) ²) O (ln (d) ln (ε - 1) + ln (d) 2) and {O} (d^2+1{n} ^-1{n}) O (d 2 + 1 n ε - 1 n) nonzero weights, where n {N} n ∈ N is arbitrary (with the constant implied in {O} () O (·) depending on n). The techniques developed in the constructive proof are of independent interest in the analysis of the expressive power of deep neural networks for solution manifolds of PDEs in high dimension.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Elbrächter et al. (2021) studied this question.

synapsesocial.com/papers/6a1bcfbd4ebd09f3dfa90e5bhttps://doi.org/10.1007/s00365-021-09541-6
Ask AI
Helpful
Bookmark
Share
View Full Paper