arXiv Machine Learning
The minimal width of neural networks and immersions of real projective space
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 7
Minimum Block Width for Universal Approximation by Residual Neural Networks with Inner Width One
arXiv:2607. 04597v1 Announce Type: new Abstract: In this paper, we study the universal approximation property of residual neural networks, and obtain some new results.
arXiv Machine Learning
Sep 18
Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks
arXiv:2609. 19937v1 Announce Type: cross Abstract: Recent studies have shown that smooth functions can be well approximated by ReLU neural networks with path norm constraint on the weights.
arXiv Machine Learning
2d ago
Deep ReLU Networks Can Fail the Best Approximation Property for Continuous Target Functions
arXiv:2610. 31264v1 Announce Type: new Abstract: We construct a continuous function on $[-1,1]^2$ for which the infimum of the $L^2$-approximation error over the class of ReLU networks with two hidden layers and architecture $(2,2,1,1)$ is not attained.
Hugging Face Trending Papers
Sep 17
Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks
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.
arXiv Machine Learning
Oct 9
NP-Hardness of Minimizing Neurons in Two-Hidden-Layer ReLU Neural Networks
arXiv:2610. 11313v1 Announce Type: new Abstract: A fundamental question in neural network architecture optimization is whether the minimum hidden-neuron count required to approximate a target function within a prescribed tolerance can be computed efficiently.
arXiv Machine Learning
6d ago
Optimal approximation of smooth functions by ReLU neural networks
arXiv:2610.22693v1 Announce Type: cross Abstract: We study uniform approximation of the H\"older ball $\mathcal H_1^s([0,1]^D)$ by fully connected ReLU networks. Except in the one-dimensional Lipschi...