ReLU2 min read
Optimal approximation of smooth functions by ReLU neural networks
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 Lipschitz case, existing constructions remain separated from the information-theoretic efficiency limit.
By Thomas NaglerarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Oct 19, 2026.
Comments
Sign in to join the discussion.