Hugging Face Trending Papers

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

Read the original on Hugging Face Trending Papers →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning
Jul 14

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

arXiv:2607. 10589v1 Announce Type: cross Abstract: In contrast to most studies on neural network approximation theory that characterize results through a single parameter, such as the total number of network parameters, \cite{shen2020deep} pioneered the characterization of approximation rates as a joint function of the width parameter $N$ and the depth parameter $L$, thereby granting greater architectural flexibility.

By Yanming Lai, Defeng Sun, Yang Wang
arXiv Machine Learning
Jun 24

Layer-wise Geometric Approximation Rates for Deep Networks

arXiv:2604. 20219v2 Announce Type: replace Abstract: Depth is widely viewed as a central contributor to the success of deep neural networks, whereas standard neural network approximation theory typically provides guarantees only for the final output and leaves the role of intermediate layers largely unclear.

By Shijun Zhang, Zuowei Shen, Yuesheng Xu