A neural multilevel method for high-dimensional parametric PDEs
In scientific machine learning, neural networks recently have become a popular tool for learning the solutions of differential equations. However, practical results often conflict the existing theoretical predictions in that observed convergence stagnates early. A substantial improvement can be achieved by the presented multilevel scheme which decomposes the considered problem into easier to train sub-problems, resulting in a sequence of neural networks. The efficacy of the approach is demonstrated for high-dimensional parametric elliptic PDEs that are common benchmark problems in uncertainty quantification. Moreover, a theoretical analysis of the expressivity of the developed neural networks is devised.
Code (0)
등록된 구현이 없습니다.
Tasks
Uncertainty QuantificationVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Multilevel CNNs for Parametric PDEs
We combine concepts from multilevel solvers for partial differential equations (PDEs) with neural network based deep learning and propose a new methodology for the efficient numerical solution of high-dimensional paramet…
Uncertainty QuantificationMultilevel CNNs for Parametric PDEs based on Adaptive Finite Elements
A neural network architecture is presented that exploits the multilevel properties of high-dimensional parameter-dependent partial differential equations, enabling an efficient approximation of parameter-to-solution maps…
Uncertainty QuantificationTowards Robust and Stable Deep Learning Algorithms for Forward Backward Stochastic Differential Equations
Applications in quantitative finance such as optimal trade execution, risk management of options, and optimal asset allocation involve the solution of high dimensional and nonlinear Partial Differential Equations (PDEs).…
Deep LearningManagementError Analysis of Kernel/GP Methods for Nonlinear and Parametric PDEs
We introduce a priori Sobolev-space error estimates for the solution of nonlinear, and possibly parametric, PDEs using Gaussian process and kernel based methods. The primary assumptions are: (1) a continuous embedding of…
Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in $L^p$-sense
We prove that multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation are capable of approximating solutions of semilinear Kolmogorov PDEs in $L^\mathfrak{p}$-sense, $\mat…