ReLU network approximation error conjecture

Let 4Θ44\Theta4 be the input domain and let fL2(Θ)f \in L^2(\Theta) satisfy f<|| f ||_{\infty} < \infty. Let fΦf_{\Phi} be the output of a ReLU network with trainable parameters Φ\Phi, consisting of LL layers and KK neurons in each layer. Then there is a constant C>0C>0 such that

minΦffΦL2(Θ)2Cf2KL+O(K2+L4).\min_{\Phi} || f - f_{\Phi} ||_{L^2(\Theta)}^2 \le C \, \frac{|| f ||_{\infty}^2}{K L} + {\mathcal O}(K^{-2} + L^{-4}).

ReLU approximation error conjecture. Under these assumptions, the displayed bound holds.

This conjecture is presented as an analogue for ReLU networks of a previously established result for Fourier-feature residual networks. It is intended to support complexity comparisons for residual multi-fidelity neural-network surrogates, but the source gives no proof or resolution.

Sources & referencesView supporting material

Primary source

Owen Davis, Mohammad Motamed and Raul Tempone, “Residual Multi-Fidelity Neural Network Computing”, arXiv:2310.03572 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.