Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks
Xianjun Li, Yunfei Yang
Abstract
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 Wn,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 W1,p-norm. For shallow networks with depth L=1, we derive the approximation error bound O(\W-(n-1)/d, K-(n-1)/(s-n)\), when the smoothness index satisfies n<s=(d+3)/2 and the input is d-dimensional. For deep networks, we remove the restriction on the smoothness by showing that the approximation bound O(K-(n-1)/(d+d/p+1)) holds if the width W and depth L are sufficiently large.
Create a lesson
Related papers
Prediction-Powered Smoothing and Validation for Disaggregated AI Evaluation
Sho Kawano, Zehang Richard Li, Paul A. Parker
TAP Accuracy Below the Fluctuation Scale and Universal Posterior Geometry in Spherical Linear Models
Jingbo Liu, Zhiyuan Yu
Online Supervised Dimension Reduction with Random Features: Diagnostics and Computational Trade-offs
Zhenlin Yao, Wei Xiong
Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning
Weiwei Wang, Yuqiang Li, Xianyi Wu et al.
Next-token functional estimation
Milind Nakul, Vidya Muthukumar, Ashwin Pananjady
Null importance: Disentangling relevance for interpretable machine learning
Garvesh Raskutti, Kris Sankaran, Jiaxin Ye