Analysis of the generalization error: Empirical risk minimization over deep artificial neural networks overcomes the curse of dimensionality in the numerical approximation of B

09/09/2018
by   Julius Berner, et al.
6

The development of new classification and regression algorithms based on empirical risk minimization (ERM) over deep neural network hypothesis classes, coined Deep Learning, revolutionized the area of artificial intelligence, machine learning, and data analysis. More recently, these methods have been applied to the numerical solution of high dimensional PDEs with great success. In particular, recent simulations indicate that deep learning based algorithms are capable of overcoming the curse of dimensionality for the numerical solution of linear Kolmogorov PDEs. Kolmogorov PDEs have been widely used in models from engineering, finance, and the natural sciences. Nearly all approximation methods for Kolmogorov PDEs in the literature suffer under the curse of dimensionality. By contrast, in recent work by some of the authors it was shown that deep ReLU neural networks are capable of approximating solutions of Kolmogorov PDEs without incurring the curse of dimensionality. The present paper considerably strengthens these results by providing an analysis of the generalization error. In particular we show that for Kolmogorov PDEs with affine drift and diffusion coefficients and a given accuracy ε>0, ERM over deep neural network hypothesis classes of size scaling polynomially in the dimension d and ε^-1 and with a number of training samples scaling polynomially in the dimension d and ε^-1 approximates the solution of the Kolmogorov PDE to within accuracy ε with high probability. We conclude that ERM over deep neural network hypothesis classes breaks the curse of dimensionality for the numerical solution of linear Kolmogorov PDEs with affine drift and diffusion coefficients. To the best of our knowledge this is the first rigorous mathematical result that proves the efficiency of deep learning methods for high dimensional problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2019

Uniform error estimates for artificial neural network approximations for heat equations

Recently, artificial neural networks (ANNs) in conjunction with stochast...
research
10/21/2022

Neural Network Approximations of PDEs Beyond Linearity: Representational Perspective

A burgeoning line of research has developed deep neural networks capable...
research
07/07/2021

Probabilistic partition of unity networks: clustering based deep approximation

Partition of unity networks (POU-Nets) have been shown capable of realiz...
research
12/24/2022

Deep Quadratic Hedging

We present a novel computational approach for quadratic hedging in a hig...
research
03/03/2021

Parametric Complexity Bounds for Approximating PDEs with Neural Networks

Recent empirical results show that deep networks can approximate solutio...
research
09/09/2021

Stationary Density Estimation of Itô Diffusions Using Deep Learning

In this paper, we consider the density estimation problem associated wit...

Please sign up or login with your details

Forgot password? Click here to reset