Deep ReLU neural networks in high-dimensional approximation (Q6079085): Difference between revisions

The paper devotes to the approximation of functions from the Hölder-Zygmund space of mixed smoothness defined on the unit cube of a high-dimensional Euclidean space with deep ReLU (Rectified Linear Unit) neural networks. The focus of the study is on computation complexity the network in order to attain a prescribed accuracy. The computational complexity is measured by the size and depth of the deep ReLU neural network, where the depth and size are defined to be the number of layers and the number of nonzero weights of the network, respectively. The main contribution of the paper is to give dimension-dependent upper and lower bounds of the computation complexity of a deep ReLU neural networks that approximates a given function from the Hölder-Zygmund space of mixed smoothness with a prescribed accuracy.