We analyze deep Neural Network emulation rates of smooth functions with point singularities in bounded, polytopal domains , . We prove exponential emulation rates in Sobolev spaces in terms of the number of neurons and in terms of the number of nonzero coefficients for Gevrey-regular solution classes defined in terms of weighted Sobolev scales in , comprising the countably-normed spaces of I.M. Babu\v{s}ka and B.Q. Guo. As intermediate result, we prove that continuous, piecewise polynomial high order (``-version'') finite elements with elementwise polynomial degree on arbitrary, regular, simplicial partitions of polyhedral domains , can be exactly emulated by neural networks combining ReLU and ReLU activations. On shape-regular, simplicial partitions of polytopal domains , both the number of neurons and the number of nonzero parameters are proportional to the number of degrees of freedom of the finite element space, in particular for the -Finite Element Method of I.M. Babu\v{s}ka and B.Q. Guo.
View on arXiv