ReLU Networks Shown to Approximate Smooth Functionals on Hilbert Space
A new arXiv preprint analyzes how well deep ReLU networks uniformly approximate smooth scalar-valued functionals defined on an infinite-dimensional separable Hilbert space. The author expresses functional inputs as expansions over a basis and derives error bounds, showing how the required network complexity scales with the decay of the input's coefficients. The results characterize a dimensional-decay effect along with accompanying error analysis.