ReLU networks approximate traceable definable subsets of the unit cube in L^p with size O(ε^{-p(n-1)/m}) and yield ERM learning rates of order N^{-m/(m+pn-p)} for hinge loss under uniform component bounds.
Hassler Whitney Collected Papers , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks
ReLU networks approximate traceable definable subsets of the unit cube in L^p with size O(ε^{-p(n-1)/m}) and yield ERM learning rates of order N^{-m/(m+pn-p)} for hinge loss under uniform component bounds.