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

被引:59
作者
Elbraechter, Dennis [1 ]
Grohs, Philipp [1 ,2 ,3 ]
Jentzen, Arnulf [4 ,5 ]
Schwab, Christoph [4 ]
机构
[1] Univ Vienna, Fac Math, Vienna, Austria
[2] Univ Vienna, Res Network Data Sci, Vienna, Austria
[3] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, Linz, Austria
[4] Swiss Fed Inst Technol, Dept Math, SAM, Zurich, Switzerland
[5] Univ Munster, Inst Anal & Numer, Fac Math & Comp Sci, Munster, Germany
基金
奥地利科学基金会; 瑞士国家科学基金会;
关键词
Neural network approximation; Low-rank approximation; Option pricing; High-dimensional PDEs; OPTIMAL APPROXIMATION; NEURAL-NETWORKS; UNIVERSAL APPROXIMATION; DEEP; BOUNDS; ALGORITHM; SMOOTH;
D O I
10.1007/s00365-021-09541-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 epsilon-error by a deep ReLU network with depth O(ln(d) ln(epsilon(-1)) + ln(d)(2)) and O(d(2+1/n) epsilon(-1/n)) nonzero weights, where n is an element of N is arbitrary (with the constant implied in O(center dot) 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.
引用
收藏
页码:3 / 71
页数:69
相关论文
共 44 条
[1]  
[Anonymous], 2007, Introduces quantitative finance
[2]  
[Anonymous], 2018, ARXIV180601528
[3]   UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :930-945
[4]  
Beck C., 2017, Journal of Nonlinear Science, P1
[5]  
Beck C., 2018, ARXIV180600421
[6]   Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black-Scholes Partial Differential Equations [J].
Berner, Julius ;
Grohs, Philipp ;
Jentzen, Arnulf .
SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2020, 2 (03) :631-657
[7]   Optimal Approximation with Sparsely Connected Deep Neural Networks [J].
Boelcskei, Helmut ;
Grohs, Philipp ;
Kutyniok, Gitta ;
Petersen, Philipp .
SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2019, 1 (01) :8-45
[8]   New exponential bounds and approximations for the computation of error probability in fading channels [J].
Chiani, M ;
Dardari, D ;
Simon, MK .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2003, 2 (04) :840-845
[9]  
CHUI CK, 1994, MATH COMPUT, V63, P607, DOI 10.1090/S0025-5718-1994-1240656-2
[10]  
Cybenko G., 1989, Mathematics of Control, Signals, and Systems, V2, P303, DOI 10.1007/BF02551274