Simultaneous Neural Network Approximation for Smooth Functions

preprint2022arXivOpen access

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 f∈Cs([0,1]d)f\in C^s([0,1]^d), we show that deep ReLU networks of width O(Nlog⁡N)\mathcal{O}(N\log{N}) and of depth O(Llog⁡L)\mathcal{O}(L\log{L}) can achieve a nonasymptotic approximation rate of O(N−2(s−1)/dL−2(s−1)/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(Nlog⁡N)\mathcal{O}(N\log{N}) and of depth O(Llog⁡L)\mathcal{O}(L\log{L}) to approximate f∈Cs([0,1]d)f\in C^s([0,1]^d), the approximation rate is O(N−2(s−n)/dL−2(s−n)/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).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.