English

Nonlocal techniques for the analysis of deep ReLU neural network approximations

Machine Learning 2025-04-08 v1 Computational Complexity Numerical Analysis Numerical Analysis

Abstract

Recently, Daubechies, DeVore, Foucart, Hanin, and Petrova introduced a system of piece-wise linear functions, which can be easily reproduced by artificial neural networks with the ReLU activation function and which form a Riesz basis of L2([0,1])L_2([0,1]). This work was generalized by two of the authors to the multivariate setting. We show that this system serves as a Riesz basis also for Sobolev spaces Ws([0,1]d)W^s([0,1]^d) and Barron classes Bs([0,1]d){\mathbb B}^s([0,1]^d) with smoothness 0<s<10<s<1. We apply this fact to re-prove some recent results on the approximation of functions from these classes by deep neural networks. Our proof method avoids using local approximations and allows us to track also the implicit constants as well as to show that we can avoid the curse of dimension. Moreover, we also study how well one can approximate Sobolev and Barron functions by ANNs if only function values are known.

Keywords

Cite

@article{arxiv.2504.04847,
  title  = {Nonlocal techniques for the analysis of deep ReLU neural network approximations},
  author = {Cornelia Schneider and Mario Ullrich and Jan Vybiral},
  journal= {arXiv preprint arXiv:2504.04847},
  year   = {2025}
}