English

Simultaneous Neural Network Approximation for Smooth Functions

Numerical Analysis 2022-07-25 v3 Numerical Analysis

Abstract

We establish in this work approximation results of deep neural networks for smooth functions measured in Sobolev norms, motivated by recent development of numerical solvers for partial differential equations using deep neural networks. {Our approximation results are nonasymptotic in the sense that the error bounds are explicitly characterized in terms of both the width and depth of the networks simultaneously with all involved constants explicitly determined.} Namely, for fCs([0,1]d)f\in C^s([0,1]^d), we show that deep ReLU networks of width O(NlogN)\mathcal{O}(N\log{N}) and of depth O(LlogL)\mathcal{O}(L\log{L}) can achieve a nonasymptotic approximation rate of O(N2(s1)/dL2(s1)/d)\mathcal{O}(N^{-2(s-1)/d}L^{-2(s-1)/d}) with respect to the W1,p([0,1]d)\mathcal{W}^{1,p}([0,1]^d) norm for p[1,)p\in[1,\infty). If either the ReLU function or its square is applied as activation functions to construct deep neural networks of width O(NlogN)\mathcal{O}(N\log{N}) and of depth O(LlogL)\mathcal{O}(L\log{L}) to approximate fCs([0,1]d)f\in C^s([0,1]^d), the approximation rate is O(N2(sn)/dL2(sn)/d)\mathcal{O}(N^{-2(s-n)/d}L^{-2(s-n)/d}) with respect to the Wn,p([0,1]d)\mathcal{W}^{n,p}([0,1]^d) norm for p[1,)p\in[1,\infty).

Keywords

Cite

@article{arxiv.2109.00161,
  title  = {Simultaneous Neural Network Approximation for Smooth Functions},
  author = {Sean Hon and Haizhao Yang},
  journal= {arXiv preprint arXiv:2109.00161},
  year   = {2022}
}
R2 v1 2026-06-24T05:35:00.023Z