Deep ReLU neural networks in high-dimensional approximation

From MaRDI portal



Abstract: We study the computation complexity of deep ReLU (Rectified Linear Unit) neural networks for the approximation of functions from the H"older-Zygmund space of mixed smoothness defined on the d-dimensional unit cube when the dimension d may be very large. The approximation error is measured in the norm of isotropic Sobolev space. For every function f from the H"older-Zygmund space of mixed smoothness, we explicitly construct a deep ReLU neural network having an output that approximates f with a prescribed accuracy varepsilon, and prove tight dimension-dependent upper and lower bounds of the computation complexity of this approximation, characterized as the size and the depth of this deep ReLU neural network, explicitly in d and varepsilon. The proof of these results are in particular, relied on the approximation by sparse-grid sampling recovery based on the Faber series.


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.



Cites work


Cited in
(25)








This page was built for publication: Deep ReLU neural networks in high-dimensional approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079085)