SOURCE-LINKED INTELLIGENCE

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

arXiv · AI, language, vision and robotics · article · Sep 17, 2026 · UTC

Recent studies have shown that smooth functions can be well approximated by ReLU neural networks with path norm constraint on the weights. We extend these results from uniform approximation to approximation in Sobolev norm. Specifically, we analyze how well Sobolev functions in $W^{n,p}$ can be approximated by neural networks with width $W$, depth $L$ and path norm bounded by $K$, when the approximation error is measured in the $W^{1,p}$-norm. For shallow networks with depth $L=1$, we derive the approximation error bound $\mathcal{O}(\max\{W^{-(n-1)/d}, K^{-(n-1)/(s-n)}\})$, when the smoothnes

Read original source ↗ Open in workspace

recordType

paper

region

Global