Error analysis for the deep Kolmogorov method
By: Iulian Cîmpean , Thang Do , Lukas Gonon and more
Potential Business Impact:
Helps computers solve hard math problems faster.
The deep Kolmogorov method is a simple and popular deep learning based method for approximating solutions of partial differential equations (PDEs) of the Kolmogorov type. In this work we provide an error analysis for the deep Kolmogorov method for heat PDEs. Specifically, we reveal convergence with convergence rates for the overall mean square distance between the exact solution of the heat PDE and the realization function of the approximating deep neural network (DNN) associated with a stochastic optimization algorithm in terms of the size of the architecture (the depth/number of hidden layers and the width of the hidden layers) of the approximating DNN, in terms of the number of random sample points used in the loss function (the number of input-output data pairs used in the loss function), and in terms of the size of the optimization error made by the employed stochastic optimization method.
Similar Papers
Error analysis for learning the time-stepping operator of evolutionary PDEs
Numerical Analysis
Teaches computers to solve hard math problems faster.
Convergence of the generalization error for deep gradient flow methods for PDEs
Numerical Analysis (Math)
Solves hard math problems with smart computer programs.
Error Analysis of Deep PDE Solvers for Option Pricing
Computational Finance
Makes stock price predictions faster and more accurate.